Algebraic Coding : First French-Israeli Workshop Paris, France, July 19-21, 1993 Proceedings / edited by G. Cohen, S. Litsyn, A. Lobstein, G. Zémor.
Contributor(s): Cohen, G | Litsyn, Simon | Lobstein, A. (Antoine) | Zémor, GMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 781.Publisher: Berlin, Heidelberg : Springer-Verlag, 1994Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540483571; 3540483578; 0387578439; 9780387578439; 3540578439; 9783540578437Subject(s): Computer science | Data encryption (Computer science) | Coding theory | Combinatorial analysis | Telecommunication | Coding theory | Combinatorial analysis | Computer science | Data encryption (Computer science) | TelecommunicationGenre/Form: Electronic books. Additional physical formats: Print version:: Algebraic Coding.DDC classification: 003.54 LOC classification: QA268Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
This 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.
Includes bibliographical references.
A 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.