Lecture Notes in Computer Science, No. 781, Springer-Verlag, 326 pages, 1994.

Gérard COHEN, Simon LITSYN, Antoine LOBSTEIN, Gilles ZÉMOR (Eds).

Contents.
V.B. Balakirsky: A necessary and sufficient condition for time-variant convolutional encoders to be noncatastrophic, p. 1
G. Kaplan, S. Shamai, Y. Kofman: On the design and selection of convolutional codes for a bursty Rician channel, p. 11
G. Poltyrev, J. Snyders: Modulo-2 separable linear codes, p. 22
V. Blinovsky, M. Pinsker: Estimation of the size of the list when decoding over an arbitrarily varying channel, p. 28
I. Honkala: A lower bound on binary codes with covering radius one, p. 34
E. Kolev, I. Landgev: On some mixed covering codes of small length, p. 38
A. Lobstein, V. Pless: The length function, a revised table, p. 51
I.E. Bocharova, B.D. Kudryashov: On the covering radius of convolutional codes, p. 56
O. Delos, J.J. Quisquater: Efficient multi-signature schemes for cooperating entities, p. 63
D. Naccache, D. M'Raihi: Montgomery-suitable cryptosystems, p. 75
C. Blundo, A. de Santis, L. Gargano, U. Vaccaro: Secret sharing schemes with veto capabilities, p. 82
J.P. Tillich, G. Zémor: Group-theoretic hash functions, p. 90
S. Bitan, T. Etzion: On constructions for optimal optical orthogonal codes, p. 111
A. Gavish, A. Lempel: On complementary sequences, p. 126
R.M. Roth: Spectral-null codes and null spaces of Hadamard submatrices, p. 141
S. Barg: On small families of sequences with low periodic correlation, p. 154
N. Alon, B. Sudakov: Disjoint systems, p. 159
O. Moreno, V.A. Zinoviev: Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs, p. 164
M.G. Karpovsky, S.M. Chaudhry, L.B. Levitin, C. Moraga: Detection and location of given sets of errors by nonbinary linear codes, p. 172
A. Bonnecaze, P. Solé: Quaternary constructions of formally self-dual binary codes and unimodular lattices, p. 194
P. Boyvalenkov, S. Nikova: New lower bounds for some spherical designs, p. 207
G. Poltyrev: Lattices based on linear codes, p. 217
P. Loyer, P. Solé: Quantizing and decoding for usual lattices in the L_p metric, p. 225
O. Amrani, Y. Be'ery, A. Vardy: Bounded-distance decoding of the Leech lattice and the Golay code, p. 236
S.I. Kovalov: Some restrictions on distance distribution of optimal binary codes, p. 249
S. Litsyn, A. Vardy: Two new upper bounds for codes of distance 3, p. 253
G. Kabatianski, A. Lobstein: On Plotkin-Elias type bounds for binary arithmetic codes, p. 263
G. Cohen, L. Huguet, G. Zémor: Bounds on generalized weights, p. 270
G. Zémor: Threshold effects in codes, p. 278
J. Rifa Coma: Decoding a bit more than the BCH bound, p. 287
N. Sendrier: Product codes and the Singleton bound, p. 304
I. Dumer, P. Farrell: Erasure correction performance of linear block codes, p. 316

Revenir à la page d'accueil