Algebraic Coding 1993: Paris, France

Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor (Eds.): Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings. Lecture Notes in Computer Science 781 Springer 1993, ISBN 3-540-57843-9 BibTeX

@proceedings{DBLP:conf/fiwac/1993,
  editor    = {G{\'e}rard D. Cohen and
               Simon Litsyn and
               Antoine Lobstein and
               Gilles Z{\'e}mor},
  title     = {Algebraic Coding, First French-Israeli Workshop, Paris, France,
               July 19-21, 1993, Proceedings},
  booktitle = {Algebraic Coding},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {781},
  year      = {1993},
  isbn      = {3-540-57843-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Convolutional codes and special channels

Vladimir B. Balakirsky: A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be Noncatastrophic. 1-10 BibTeX
Gideon Kaplan, Shlomo Shamai, Yosef Kofman: On the Design and Selection of Convolutional Codes for a Bursty Rician Channel. 11-21 BibTeX
Gregory Poltyrev, Jakov Snyders: MODULO-2 Separable Linear Codes. 22-27 BibTeX
Volodia Blinovsky, M. Pinsker: Estimation of the size of the list when decoding over an arbitrarily varying channel. 28-33 BibTeX

Covering codes

Iiro S. Honkala: A Lower Bound on Binary Codes with Covering Radius One. 34-37 BibTeX
E. Kolev, Ivan N. Landgev: On Some Mixed Covering Codes of Small Length. 38-50 BibTeX
Antoine Lobstein, Vera Pless: The Length Function: A Revised Table. 51-55 BibTeX
Irina E. Bocharova, Boris D. Kudryashov: On the covering radius of convolutional codes. 56-62 BibTeX

Cryptography

Olivier Delos, Jean-Jacques Quisquater: Efficient multi-signature schemes for cooperating entities. 63-74 BibTeX
David Naccache, David M'Raïhi: Montgomery-Suitable Cryptosystems. 75-81 BibTeX
Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: Secret Sharing Schemes with Veto Capabilities. 82-89 BibTeX
Jean-Pierre Tillich, Gilles Zémor: Group-theoretic hash functions. 90-110 BibTeX

Sequences

Sara Bitan, Tuvi Etzion: On Constructions for Optimal Optical Orthogonal Codes. 111-125 BibTeX
Amnon Gavish, Abraham Lempel: On Complementary Sequences. 126-140 BibTeX
Ron M. Roth: Spectral-Null Codes and Null Spaces of Hadamard Submatrices. 141-153 BibTeX
Sascha Barg: On small families of sequences with low periodic correlation. 154-158 BibTeX

Graphs and codes

Noga Alon, Benny Sudakov: Disjoint Systems (Extended Abstract). 159-163 BibTeX
Oscar Moreno, Victor Zinoviev: Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs. 164-171 BibTeX
Mark G. Karpovsky, Saeed M. Chaudhry, Lev B. Levitin, Claudio Moraga: Detection and Location of Given Sets of Errors by Nonbinary Linear Codes. 172-193 BibTeX

Sphere packings and lattices

Alexis Bonnecaze, Patrick Solé: Quaternary constructions of formally self-dual binary codes and unimodular lattices. 194-205 BibTeX
Peter Boyvalenkov, Svetla Nikova: New lower bounds for some spherical designs. 207-216 BibTeX
Gregory Poltyrev: Lattices Based on Linear Codes. 217-224 BibTeX
Pierre Loyer, Patrick Solé: Quantizing and decoding for usual lattices in the L_P-metric. 225-235 BibTeX
Ofer Amrani, Yair Be'ery, Alexander Vardy: Bounded-Distance Decoding of the Leech Lattice and the Golay Code. 236-248 BibTeX

Bounds for codes

Sergei I. Kovalov: Some restrictions on distance distribution of optimal binary codes. 249-252 BibTeX
Simon Litsyn, Alexander Vardy: Two new upper bounds for codes of distance 3. 253-262 BibTeX
Gregory Kabatianskii, Antoine Lobstein: On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. 263-269 BibTeX
Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor: Bounds on generalized weights. 270-277 BibTeX
Gilles Zémor: Threshold effects in codes. 278-286 BibTeX
Josep Rifà-Coma: Decoding a bit more than the BCH bound. 287-303 BibTeX
Nicolas Sendrier: Product codes and the Singleton bound. 304-315 BibTeX
Ilya Dumer, Patrick G. Farrell: Erasure Correction Performance of Linear Block Codes. 316-326 BibTeX