5. AAECC 1987: Menorca, Spain

• Annie Astié-Vidal, A. Matteo:
  Non Simple Tournaments: Theoretical Properties and a Polynomial Algorithm. 1-15
• Josep M. Basart, Josep Rifà:
  Covering Radius for Codes Obtained from T(m) Triangular Graphs. 16-24
• Michel Bauderon, François Laubié:
  Searching for Weakly Autocorrelated Binary Sequences. 25-34
• Alberto Bertoni, Massimiliano Goldwurm:
  On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages. 35-59
• Martin Bossert:
  On Decoding Binary Quadratic Residue Codes. 60-68
• Pedro J. Burillo, León A. González:
  Pseudometrics Associated with Fuzzy Relations Having Weak Properties. 69-74
• Jacques Calmet:
  Towards an Expert System for Error-Correcting Codes: SECC. 75-87
• Paul Camion:
  An Iterative Euclidean Algorithm. 88-128
• Giuseppa Carrà Ferro:
  Groebner Bases and Differential Algebra. 129-140
• Giuseppa Carrà Ferro, Giovanni Gallo:
  A Procedure to Prove Geometrical Statements. 141-150
• Pascale Charpin:
  Some Applications of Classification of Affine-Invariant Codes. 151-160
• Felipe Cucker, Luis Miguel Pardo, Mario Raimondo, Tomás Recio, Marie-Françoise Roy:
  On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve. 161-181
• Ding-Jia Xin:
  Distribution of Codewords and Decoding Error Rate in RS Codes with Application to Performance Evaluation from Optical Disc. 182-201
• Arne Dür:
  On Generalized Minimum Distance Decoding. 202-215
• Roberto Dvornicich, Carlo Traverso:
  Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields. 216-224
• Gérard D. Cohen:
  Non Linear Covering Codes: A Few Results and Conjectures. 225-229
• Alfredo Ferro, Giovanni Gallo:
  Groebner Bases, Ritt's Algorithm and Decision Procedures for Algebraic Theories. 230-237
• Miguel Angel Fiol, Oriol Serra:
  An Algebraic Model for the Storage of Data in Parallel Memories. 238-246
• Patrizia M. Gianni, Teo Mora:
  Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases. 247-257
• M. Grieco, B. Zucchetti:
  How to Decide Whether a Polynomial Ideal is Primary or Not. 258-268
• Joos Heintz:
  On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. 269-300
• Hideki Imai, Tsutomu Matsumoto:
  Coding Theory and its Applications in Japan. 301-305
• Helge Elbrønd Jensen, Tom Høholdt:
  Binary Sequences with Good Correlation Properties. 306-320
• Juan Llovet, J. Rafael Sendra:
  Hankel Matrices and Polynomials. 321-333
• Paz Morillo, Miguel Angel Fiol, J. Guitart:
  On the (d, D, D, s) - Digraph Problem. 334-340
• Paliath Narendran, Friedrich Otto:
  It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free. 341-349
• Graham H. Norton:
  A Shift-Remainder GCD Algorithm. 350-356
• E. Olcayto, A. Birse:
  New Class of Cyclic, Random and Burst Error Correcting Codes. 357-368
• Philippe Piret:
  A Conjecture on the Free Distance of (2, 1m) Binary Convolutional Codes. 369-375
• Josep Rifà-Coma:
  On the Construction of Completely Regular Linear Codes from Distance-Regular Graphs. 376-393
• Shojiro Sakata:
  Synthesis of Two-Dimensional Linear Feedback Shift Registers and Groebner Bases. 394-407
• Volker Weispfenning:
  Constructing Universal Groebner Bases. 408-417