Algebraic Coding: First French-Israeli Workshop Paris, France, July 19–21, 1993 Proceedings

V. B. Balakirsky (auth.), G. Cohen, S. Litsyn, A. Lobstein, G. Zémor (eds.)3540578439, 9783540578437

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.

---

Table of contents :
A necessary and sufficient condition for time-variant convolutional encoders to be noncatastrophic….Pages 1-10
On the design and selection of convolutional codes for a bursty Rician channel….Pages 11-21
Modulo-2 separable linear codes….Pages 22-27
Estimation of the size of the list when decoding over an arbitrarily varying channel….Pages 28-33
A lower bound on binary codes with covering radius one….Pages 34-37
On some mixed covering codes of small length….Pages 38-50
The length function: A revised table….Pages 51-55
On the covering radius of convolutional codes….Pages 56-62
Efficient multi-signature schemes for cooperating entities….Pages 63-74
Montgomery-suitable cryptosystems….Pages 75-81
Secret sharing schemes with veto capabilities….Pages 82-89
Group-theoretic hash functions….Pages 90-110
On constructions for optimal optical orthogonal codes….Pages 111-125
On complementary sequences….Pages 126-140
Spectral-null codes and null spaces of Hadamard submatrices….Pages 141-153
On small families of sequences with low periodic correlation….Pages 154-158
Disjoint systems (Extended abstract)….Pages 159-163
Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs….Pages 164-171
Detection and location of given sets of errors by nonbinary linear codes….Pages 172-193
Quaternary constructions of formally self-dual binary codes and unimodular lattices….Pages 194-205
New lower bounds for some spherical designs….Pages 207-216
Lattices based on linear codes….Pages 217-224
Quantizing and decoding for usual lattices in the L p -metric….Pages 225-235
Bounded-distance decoding of the Leech lattice and the Golay code….Pages 236-248
Some restrictions on distance distribution of optimal binary codes….Pages 249-252
Two new upper bounds for codes of distance 3….Pages 253-262
On Plotkin-Elias type bounds for binary arithmetic codes….Pages 263-269
Bounds on generalized weights….Pages 270-277
Threshold effects in codes….Pages 278-286
Decoding a bit more than the BCH bound….Pages 287-303
Product codes and the singleton bound….Pages 304-315
Erasure correction performance of linear block codes….Pages 316-326