Abstract is missing.
- Information Theory in Random FieldsToby Berger. 1-18
- Linear Complexity in Coding TheoryJames L. Massey, Thomas Schaub. 19-32
- K-PermutivityGilbert Roux. 33-38
- On the Density of Best Coverings in Hamming SpacesM. Beveraggi, Gérard D. Cohen. 39-44
- The Lee Association SchemePatrick Solé. 45-55
- On Modular Weights in Arithmetic CodesAntoine Lobstein. 56-67
- Optimum 1 -Ended Binary Prefix CodesToby Berger, Raymond W. Yeung. 68-75
- Optimality of Right Leaning TreesHerman Akdag, Bernadette Bouchon. 76-85
- Specification, Synchronisation, Average LengthAnne Bertrand. 86-95
- Amerlioration of the Mc Williams-Sloanes Tables using Geometric Codes from Curves with Genus 1, 2 or 3Yves Driencourt, Jean-Francis Michon. 96-105
- A [32, 17, 14] - Geometric Code coming from a Singular CurveDominique Le Brigand. 106-115
- The Generalized Goppa Codes and Related Discrete Designs from Hermitian Surfaces in PG (3, s:::2:::)I. M. Chakravarti. 116-124
- Projective Reed - Muller CodesGilles Lachaud. 125-129
- A Lower Bound on the Minimum Euclidean Distance of Trellis CodesMarc Rouanne, Daniel J. Costello Jr.. 130-140
- On the Inherent Intractability of Soft Decision Decoding of Linear CodesJ. Fang, Gérard D. Cohen, Philippe Godlewski, Gerard Battail. 141-149
- Weighted Decoding as a Means for Reestimating a Probability Distribution (Abstract)Gerard Battail. 150-153
- A Weighted-Output Symbol-by-Symbol Decoding Algorithm of Binary Convolutional CodesJ. C. Belfiore. 154-158
- Search for Sequences with Zero AutocorrelationRoger Alexis. 159-172
- Adapted Codes for Communication Through Multipath ChannelG. Hakizimana, G. Jourdain, G. Loubet. 173-182
- Coding and Decoding Algorithms of Reed - Solomon Codes Executed on a M 68000 MicroprocessorFrancisco J. García-Ugalde. 183-196