000 04212nam a22005775i 4500
001 978-3-540-48357-1
003 DE-He213
005 20160624102033.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 _a9783540483571
_9978-3-540-48357-1
024 7 _a10.1007/3-540-57843-9
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM031000
_2bisacsh
082 0 4 _a003.54
_223
245 1 0 _aAlgebraic Coding
_h[electronic resource] :
_bFirst French-Israeli Workshop Paris, France, July 19–21, 1993 Proceedings /
_cedited by G. Cohen, S. Litsyn, A. Lobstein, G. Zémor.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
300 _aXII, 332 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v781
505 0 _aA necessary and sufficient condition for time-variant convolutional encoders to be noncatastrophic -- On the design and selection of convolutional codes for a bursty Rician channel -- Modulo-2 separable linear codes -- Estimation of the size of the list when decoding over an arbitrarily varying channel -- A lower bound on binary codes with covering radius one -- On some mixed covering codes of small length -- The length function: A revised table -- On the covering radius of convolutional codes -- Efficient multi-signature schemes for cooperating entities -- Montgomery-suitable cryptosystems -- Secret sharing schemes with veto capabilities -- Group-theoretic hash functions -- On constructions for optimal optical orthogonal codes -- On complementary sequences -- Spectral-null codes and null spaces of Hadamard submatrices -- On small families of sequences with low periodic correlation -- Disjoint systems (Extended abstract) -- Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs -- Detection and location of given sets of errors by nonbinary linear codes -- Quaternary constructions of formally self-dual binary codes and unimodular lattices -- New lower bounds for some spherical designs -- Lattices based on linear codes -- Quantizing and decoding for usual lattices in the L p -metric -- Bounded-distance decoding of the Leech lattice and the Golay code -- Some restrictions on distance distribution of optimal binary codes -- Two new upper bounds for codes of distance 3 -- On Plotkin-Elias type bounds for binary arithmetic codes -- Bounds on generalized weights -- Threshold effects in codes -- Decoding a bit more than the BCH bound -- Product codes and the singleton bound -- Erasure correction performance of linear block codes.
520 _aThis volume presents the proceedings of the first French-Israeli Workshop on Algebraic Coding, which took place in Paris in July 1993. The workshop was a continuation of a French-Soviet Workshop held in 1991 and edited by the same board. The thoroughly refereed papers in this volume are grouped into parts on: convolutional codes and special channels, covering codes, cryptography, sequences, graphs and codes, sphere packings and lattices, and bounds for codes.
650 0 _aComputer science.
650 0 _aData encryption (Computer science).
650 0 _aCoding theory.
650 0 _aCombinatorics.
650 0 _aTelecommunication.
650 1 4 _aComputer Science.
650 2 4 _aCoding and Information Theory.
650 2 4 _aData Encryption.
650 2 4 _aCombinatorics.
650 2 4 _aCommunications Engineering, Networks.
700 1 _aCohen, G.
_eeditor.
700 1 _aLitsyn, S.
_eeditor.
700 1 _aLobstein, A.
_eeditor.
700 1 _aZémor, G.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540578437
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v781
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-57843-9
942 _2EBK6434
_cEBK
999 _c35728
_d35728