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