3. AAECC 1985: Grenoble, France

• Thomas Beth:
  On the Arithmetics of Galoisfields and The Like. Algebraic Questions Arising in the Design of Secure Communication Systems. 2-16
  
• Michael Gundlach:
  On Strongly Tactical Codes. 17-26
  
• André Oisel:
  Integer Programming Applied to Eigenvector Computation in a Class of Markov Processes. 27-33
  
• Pascale Charpin:
  A Minimum System of Generators for Extended Cyclic Codes which are Invariant under the Affine Group. 34-42
  
• Alain Poli:
  Some Algebraic Tools for Error-Correcting Codes. 43-60
  
• Sylvia M. Jennings:
  On Computing the Performance Probabilities of Reed-Solomon Codes. 61-68
  
• J. Constantin, Bertrand Courteau, Jacques Wolfmann:
  Numerical Experiments Related to the Covering Radius of Some First Order Reed-Muller Codes. 69-75
  
• C. Goutelard:
  Several Aspects of Problems Encountered in Coding Applications. 76-94
  
• M. C. Gennero, D. Randriananja:
  Software Simulation of Data Transmission Using Error-Correcting Codes Through an AWGN Channel. 95-107
  
• Hideki Imai, Tsutomu Matsumoto:
  Algebraic Methods for Constructing Asymmetric Cryptosystems. 108-119
  
• Heeralal Janwa, H. F. Mattson Jr.:
  Covering Radii of Even Subcodes of t-dense Codes. 120-130
  
• Walter Fumy:
  Orthogonal Transform Encoding of Cyclic Codes. 131-134
  
• Mercè Griera, Josep Rifà, Llorenç Huguet i Rotger:
  On S-Sum-Sets and Projective Codes. 135-142
  
• Llorenç Huguet i Rotger, Josep Rifà, Mercè Griera:
  Pseudo-Triple-Sum-Sets and Association Schemes. 143-149
  
• Martin Bossert, Ferdinand Hergert:
  A Decoding Algorithm for Linear Codes. 150-155
  
• Hans Opolka:
  The Finite Fourier-Transform and Theta Functions. 156-166
  
• Jacques Wolfmann:
  Recent Results on Coding and Algebraic Geometry. 167-184
  
• Yves Driencourt:
  Some Properties of Elliptic Codes Over a Field of Characteristic 2. 185-193
  
• Alain Poli, C. Rigoni:
  Self-Dual Codes 2n Circulant Over F_q (q=2^r). 194-201
  
• M. Ventou:
  Automorphisms and Isometries of Some Modular Algebras. 202-210
  
• Hans F. de Groote, Joos Heintz:
  A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. 211-222
  
• Dominique Le Brigand:
  On Computational Complexity of Some Algebraic Curves Over Finite Fields. 223-227
  
• M. F. Newman:
  Some Group Presentations and Enforcing the Associative Law. 228-237
  
• Edward G. Belaga:
  Fast Computation of Linear Finite-Dimensional Operators over Arbitrary Rings. 238-246
  
• W. Böge:
  Quantifier Elimination for Real Closed Fields. 247-261
  
• Volker Weispfenning:
  Efficient Decision Algorithms for Locally Finite Theories. 262-273
  
• Roland Mirwald:
  The Algorithmic Structure of sl(2, k). 274-287
  
• Annemarie Fellmann:
  Optimal Algorithms for Finite Dimensional Simply Generated Algebras. 288-295
  
• Heinz Lüneburg:
  On a Little but Useful Algorithm. 296-301
  
• Johannes Buchmann, Attila Pethö:
  Computation of Independent Units in Number Fields by Dirichlet's Method. 302-305
  
• Giuseppa Carrà Ferro:
  Some Upper Bounds for the Multiplicity of an Autoreduced Subset of N^m and their Applications. 306-315
  
• Asish Mukhopadhyay, Vangalur S. Alagar:
  Exact Computation of the Characteristic Polynomial of an Integer Matrix. 316-324
  
• Rüdiger Loos:
  An Analysis of the Krönecker Algorithm for Factorization of Algebraic Polynomials. 325
  
• Guy Viry:
  Polynomial Factorization over Z[x]. 326-332
  
• Bruno Buchberger:
  The L-Machine: An Attempt at Parallel Hardware for Symbolic Computation. 333-347
  
• William Leler, Neil Soiffer:
  An Interactive Graphical Interface for Symbolic Algebra Systems. 348-352
  
• Ferdinando Mora:
  Groebner Bases for Non-Commutative Polynomial Rings. 353-362
  
• Graham H. Norton:
  Extending the Binary GCD Algorithm. 363-372
  
• Trevor J. Smedley:
  Integration of Rational Functions in SAC-2. 373-384
  
• Denis Lugiez:
  Heuristic Bivariate Lifting. 385-391
  
• Anthony C. Hearn:
  Optimal Evaluation of Algebraic Expressions. 392-403
  
• Neil V. Murray, Erik Rosenthal:
  On Deleting Links in Semantic Graphs. 404-415