Algebraic Coding 1991: Paris, France

• Aimo Tietäväinen:
  On the Correlation fo Sequences. 1-4
  
• Igor Shparlinski:
  On Gaussian Sums for Finite Fields and Elliptic Curves. 5-15
  
• Alexander Barg:
  Exponential Sums and Constrained Error-Correcting Codes. 16-22
  
• Alexander A. Davydov:
  Constructions of Codes with Covering Radius 2. 23-31
  
• Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.:
  On Perfect Weighted Coverings with Small Radius. 32-41
  
• Gilles Zémor:
  An Extremal Problem Related to the Covering Radius of Binary Codes. 42-51
  
• G. L. Katsman:
  Bounds on Covering Radius of Dual Product Codes. 52-57
  
• Vera Pless:
  Remarks on Greedy Codes. 58-66
  
• Ilya Dumer:
  On Nonbinary Codes with Fixed Distance. 67-74
  
• Danièle Gardy, Patrick Solé:
  Saddle Point Techniques in Asymptotic Coding Theory. 75-81
  
• Sergei I. Kovalev:
  Nonbinary Low Rate Convolutional Codes with Almost Optimum Weight Spectrum. 82-86
  
• Benjamin Arazi:
  Position Recovery on a Circle Based on Coding Theory. 87-101
  
• Volodia Blinovsky:
  The Lower Bound for Cardinality of Codes Correcting Errors and Defects. 102-112
  
• Boris D. Kudryashov:
  Soft Decoding for Block Codes Obtained from Convolutional Codes. 113-119
  
• Jakov Snyders:
  Partial Ordering of Error Patterns for Maximum Likelihood Soft Decoding. 120-125
  
• Ernst M. Gabidulin:
  A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes. 126-133
  
• Alexei E. Ashikhmin, Simon Litsyn:
  A Fast Search for the Maximum Element of the Fourier Spectrum. 134-141
  
• Vladimir B. Balakirsky:
  Coding Theorem for Discrete Memoryless Channels with Given Decision Rule. 142-150
  
• Irina E. Bocharova:
  Decoding for Multiple-Access Channels. 151-158