12. AAECC 1997: Toulouse, France

• Alexander Barg:
  Minimum Distance Decoding Algorithms for Linear Codes. 1-14
  
• Laurent Bernardin, Michael B. Monagan:
  Efficient Multivariate Factorization over Finite Fields. 15-28
  
• Peter Boyvalenkov, Danyo Danev:
  On Maximal Codes in Polynominal Metric Spaces. 29-38
  
• Massimo Caboara, Pasqualina Conti, Carlo Traverso:
  Yet Another Ideal Decomposition Algorithm. 39-54
  
• Giuseppa Carrà Ferro:
  A Resultant Theory for Ordinary Algebraic Differential Equations. 55-65
  
• Sueli I. Rodrigues Costa, João Roberto Gerônimo, Reginaldo Palazzo Jr., J. Carmelo Interlando, Marcelo Muniz Silva Alves:
  The Symmetry Group of Zⁿ_q in the Lee Space and the Z_qⁿ-Linear Codes. 66-77
• Sylvia B. Encheva:
  On Repeated-Root Cyclic Codes and the Two-Way Chain Condition. 78-87
  
• Joachim von zur Gathen, Michael Nöcker:
  Exponentiation in Finite Fields: Theory and Practice. 88-113
  
• Dima Grigoriev, Anatol Slissenko:
  Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane. 114-129
  
• T. Aaron Gulliver, Masaaki Harada:
  Certain Self-Dual Codes over Z₄ and the Odd Leech Lattice. 130-137
  
• Tom Høholdt, Jacobus H. van Lint, Ruud Pellikaan:
  Order Functions and Evaluation Codes. 138-150
  
• Kathy J. Horadam, A. A. I. Perera:
  Codes from Cocycles. 151-163
  
• David B. Jaffe:
  A Brief Tour of Split Linear Programming. 164-173
  
• Frédéric Jean, Pierre-Vincent Koseleff:
  Elementary Approximation of Exponentials of Lie Polynominals. 174-188
  
• Jørn M. Jensen:
  On the q-ary Image of Cyclic Codes. 189-196
  
• Tadao Kasami, Tsukasa Sugita, Toru Fujiwara:
  The Split Weight (w_L, w_R) Enumeration of Reed-Muller Codes for w_L + w_R < 2d_min. 197-211
  
• Ivan N. Landjev:
  Optimal Linear Codes of Dimension 4 over GF(5). 212-220
  
• Daniel Mall:
  Characterisations of Lexicographic Sets and Simply-Connected Hilbert Schemes. 221-236
  
• Miodrag J. Mihaljevic:
  An Iterative Probabilistic Decoding Algorithm for Binary Linear Block Codes Beyond the Half Minimum Distance. 237-249
  
• Miodrag J. Mihaljevic:
  Security Examination of a Cellular Automata Based Pseudorandom Bit Generator Using an Algebraic Replica Approach. 250-262
  
• Alexander A. Nechaev, Alexey S. Kuzmin:
  Formal Duality of Linearly Presentable Codes over a Galois Field. 263-276
  
• Alexander A. Nechaev, Alexey S. Kuzmin:
  Trace-Function on a Galois Ring in Coding Theory. 277-290
  
• Shojiro Sakata:
  A Vector Version of the BMS Algorithm for Implementing Fast Erasure-and-Error Decoding of One-Point AG Codes. 291-310
  
• Tomoharu Shibuya, Jiro Mizutani, Kohichi Sakaniwa:
  On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Sets. 311-320
  
• Horacio Tapia-Recillas, Gerardo Vega, Enrique Daltabuit:
  Some Results on Regular Mappings. 321-328
  
• Jay A. Wood:
  Extension Theorems for Linear Codes over Finite Rings. 329-340
  
• Shutao Xia, Fangwei Fu:
  Nonperiodic Cyclic Equivalence Classes of Cyclic Codes and Algebraic Constructions of Cyclically Permutable Codes. 341-352