Algebraic Algorithms and Error-Correcting Codes: 3rd International Conference, AAECC-3 Grenoble, France, July 15–19, 1985 Proceedings

Introduction....Pages 1-1
On the arithmetics of Galoisfields and the like....Pages 2-16
On strongly tactical codes....Pages 17-26
Integer programming applied to eigenvector computation in a class of Markov processes....Pages 27-33
A minimum system of generators for extended cyclic codes which are invariant under the affine group....Pages 34-42
Some algebraic tools for error-correcting codes....Pages 43-60
On computing the performance probabilities of Reed-Solomon codes....Pages 61-68
Numerical experiments related to the covering radius of some first order Reed-Muller codes....Pages 69-75
Several aspects of problems encountered in coding applications....Pages 76-94
Software simulation of data transmission using error-correcting codes, through an awgn channel....Pages 95-107
Algebraic methods for constructing asymmetric cryptosystems....Pages 108-119
Covering radii of even subcodes of t-dense codes....Pages 120-130
Orthogonal transform encoding of cyclic codes....Pages 131-134
On s-sum-sets and projective codes....Pages 135-142
Pseudo-triple-sum-sets and association schemes....Pages 143-149
A decoding algorithm for linear codes....Pages 150-155
The finite Fourier-transform and theta functions....Pages 156-166
Recent results on coding and algebraic geometry....Pages 167-184
Some properties of elliptic codes over a field of characteristic 2....Pages 185-193
Self-dual codes 2n circulant over F q (q=2 r )....Pages 194-201
Automorphisms and isometries of some modular algebras....Pages 202-210
A lower bound for the bilinear complexity of some semisimple lie algebras....Pages 211-222
On computational complexity of some algebraic curves over finite fields....Pages 223-227
Some group presentations and enforcing the associative law....Pages 228-237
Fast computation of linear finite-dimensional operators over arbitrary rings....Pages 238-246
Quantifier elimination for real closed fields....Pages 247-261
Efficient decision algorithms for locally finite theories....Pages 262-273
The algorithmic structure of $$\\mathfrak{s}\\mathfrak{l}(2,k)$$ ....Pages 274-287
Optimal algorithms for finite dimensional simply generated algebras....Pages 288-295
On a little but useful algorithm....Pages 296-301
Computation of independent units in number fields by Dirichlet\'s method....Pages 302-305
Some upper bounds for the multiplicity of an autoreduced subset of N m and their applications....Pages 306-315
Exact computation of the characteristic polynomial of an integer matrix....Pages 316-324
An analysis of the Krönecker algorithm for factorization of algebraic polynomials....Pages 325-325
Polynomial factorization over ℤ[X]....Pages 326-332
The L-machine: An attempt at parallel hardware for symbolic computation....Pages 333-347
An interactive graphical interface for symbolic algebra systems....Pages 348-352
Groebner bases for non-commutative polynomial rings....Pages 353-362
Extending the binary GCD algorithm....Pages 363-372
Integration of rational functions in SAC-2....Pages 373-384
Heuristic bivariate lifting....Pages 385-391
Optimal evaluation of algebraic expressions....Pages 392-403
On deleting links in semantic graphs....Pages 404-415
Erratum....Pages 0-0