4. AAECC 1986: Karlsruhe, Germany

• Thomas Beth:
  Introduction. 1-4
• Josep M. Basart, Llorenç Huguet i Rotger:
  From T(m) Triangular Graphs to Single-Error-Correcting Codes. 5-12
  
• Guilherme Bittencourt:
  Integration of Graphical Tools in a Computer Algebra System. 13-24
  
• Jacques Calmet, Hubert Comon, Denis Lugiez:
  Type Inference Using Unification in Computer Algebra. 25-28
  
• Arne Dür:
  The Weight Distribution of Double-Error-Correcting Goppa Codes. 29-42
  
• Thomas H. E. Ericson:
  A Simple Analysis of the Blokh-Zyablov Decoding Algorithm. 43-57
  
• Francisco J. García-Ugalde, Robert Morelos-Zaragoza:
  Design of a Viterbi Decoder with Microprocessor-Based Serial. 58-67
  
• Mercè Griera:
  On s-Sums-Sets (s odd) and Three-Weight Projective Codes. 68-76
  
• Gianfranco Mascari, Alfonso Miola:
  On the Integration of Numeric and Algebraic Computations. 77-87
  
• Paolo Massazza, Giancarlo Mauri, P. Righi, Mauro Torelli:
  A Symbolic Manipulation System for Combinatorial Problems. 88-97
  
• Teo Mora:
  Standard Bases and Non-Noetherianity: Non-Commutative Polynomial Rings. 98-109
  
• Hans Opolka:
  Embedding Self-Dual Codes into Projective Space. 110-112
  
• Hans Opolka:
  The Finite Fourier-Transform as a Modular Substitution. 113-119
  
• Marilena Pittaluga, Elisabetta Strickland:
  On Computers and Modular Representations of SL_n(K). 120-129
  
• Alain Poli:
  Construction of SDMC Codes over GF(2) or GF(3). 130-138
  
• Alain Poli, M. C. Gennero:
  Fast16: A Software Program for Factorising Polynomials over Large GF(p). 139-156
  
• Josep Rifà, Llorenç Huguet i Rotger:
  Characterization of Completely Regular Codes through P-Polynomial Association Schemes. 157-167
  
• Mohammad Amin Shokrollahi:
  Codes on Hermitian Curves. 168-176
  
• J. A. Thiong-Ly:
  Symmetrics of Cyclic Extended Goppa Codes over F_q. 177-194
  
• Volker Weispfenning:
  Some Bounds for the Construction of Gröbner Bases. 195-201
  
• Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
  Analysis of a Class of Algorithms for Problems on Trace Languages. 202-214