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