Abstract is missing.
- A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be NoncatastrophicVladimir B. Balakirsky. 1-10
- On the Design and Selection of Convolutional Codes for a Bursty Rician ChannelGideon Kaplan, Shlomo Shamai, Yosef Kofman. 11-21
- MODULO-2 Separable Linear CodesGregory Poltyrev, Jakov Snyders. 22-27
- Estimation of the size of the list when decoding over an arbitrarily varying channelVolodia Blinovsky, M. Pinsker. 28-33
- A Lower Bound on Binary Codes with Covering Radius OneIiro S. Honkala. 34-37
- On Some Mixed Covering Codes of Small LengthE. Kolev, Ivan N. Landgev. 38-50
- The Length Function: A Revised TableAntoine Lobstein, Vera Pless. 51-55
- On the covering radius of convolutional codesIrina E. Bocharova, Boris D. Kudryashov. 56-62
- Efficient multi-signature schemes for cooperating entitiesOlivier Delos, Jean-Jacques Quisquater. 63-74
- Montgomery-Suitable CryptosystemsDavid Naccache, David M Raïhi. 75-81
- Secret Sharing Schemes with Veto CapabilitiesCarlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro. 82-89
- Group-theoretic hash functionsJean-Pierre Tillich, Gilles Zémor. 90-110
- On Constructions for Optimal Optical Orthogonal CodesSara Bitan, Tuvi Etzion. 111-125
- On Complementary SequencesAmnon Gavish, Abraham Lempel. 126-140
- Spectral-Null Codes and Null Spaces of Hadamard SubmatricesRon M. Roth. 141-153
- On small families of sequences with low periodic correlationSascha Barg. 154-158
- Disjoint Systems (Extended Abstract)Noga Alon, Benny Sudakov. 159-163
- Some sufficient conditions for 4-regular graphs to have 3-regular subgraphsOscar Moreno, Victor Zinoviev. 164-171
- Detection and Location of Given Sets of Errors by Nonbinary Linear CodesMark G. Karpovsky, Saeed M. Chaudhry, Lev B. Levitin, Claudio Moraga. 172-193
- Quaternary constructions of formally self-dual binary codes and unimodular latticesAlexis Bonnecaze, Patrick Solé. 194-205
- New lower bounds for some spherical designsPeter Boyvalenkov, Svetla Nikova. 207-216
- Lattices Based on Linear CodesGregory Poltyrev. 217-224
- Quantizing and decoding for usual lattices in the L::P::-metricPierre Loyer, Patrick Solé. 225-235
- Bounded-Distance Decoding of the Leech Lattice and the Golay CodeOfer Amrani, Yair Be ery, Alexander Vardy. 236-248
- Some restrictions on distance distribution of optimal binary codesSergei I. Kovalov. 249-252
- Two new upper bounds for codes of distance 3Simon Litsyn, Alexander Vardy. 253-262
- On Plotkin-Elias Type Bounds for Binary Arithmetic CodesGregory Kabatianskii, Antoine Lobstein. 263-269
- Bounds on generalized weightsGérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor. 270-277
- Threshold effects in codesGilles Zémor. 278-286
- Decoding a bit more than the BCH boundJosep Rifà-Coma. 287-303
- Product codes and the Singleton boundNicolas Sendrier. 304-315
- Erasure Correction Performance of Linear Block CodesIlya Dumer, Patrick G. Farrell. 316-326