Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 6th International Conference, AAECC-6 Rome, Italy, July 4–8, 1988 Proceedings

E. F. Assmus Jr. (auth.), Teo Mora (eds.)3540510834, 9783540510833

In 1988, for the first time, the two international conferences AAECC-6 and ISSAC’88 (International Symposium on Symbolic and Algebraic Computation, see Lecture Notes in Computer Science 358) have taken place as a Joint Conference in Rome, July 4-8, 1988. The topics of the two conferences are in fact widely related to each other and the Joint Conference presented a good occasion for the two research communities to meet and share scientific experiences and results. The proceedings of the AAECC-6 are included in this volume. The main topics are: Applied Algebra, Theory and Application of Error-Correcting Codes, Cryptography, Complexity, Algebra Based Methods and Applications in Symbolic Computing and Computer Algebra, and Algebraic Methods and Applications for Advanced Information Processing. Twelve invited papers on subjects of common interest for the two conferences are divided between this volume and the succeeding Lecture Notes volume devoted to ISSACC’88. The proceedings of the 5th conference are published as Vol. 356 of the Lecture Notes in Computer Science.

---

Table of contents :
The coding theory of finite geometries and designs….Pages 1-6
Recent results on covering problems….Pages 7-21
Codes and curves….Pages 22-30
Computer and commutative algebra….Pages 31-44
The multiplicative complexity of boolean functions….Pages 45-58
An algorithm on quasi-ordinary polynomials….Pages 59-73
A computer-aided design for sampling a nonlinear analytic system….Pages 74-88
Decoding of generalized concatenated codes….Pages 89-98
Backtrack searching in the presence of symmetry….Pages 99-110
Fast serial-parallel multipliers….Pages 111-121
On the complexity of computing class groups of algebraic number fields….Pages 122-130
Some new effectivity bounds in computational geometry….Pages 131-151
Some remarks on the differential dimension….Pages 152-163
On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors….Pages 164-168
Big numbers p-adic arithmetic: A parallel approach….Pages 169-180
Monomial ideals, group algebras and error correcting codes….Pages 181-188
Fast integer multiplication by block recursive, number theoretical transforms….Pages 189-200
Lambda-Upsilon-Omega: An assistant algorithms analyzer….Pages 201-212
Global dimension of associative algebras….Pages 213-229
Symmetry and duality in normal basis multiplication….Pages 230-238
Multiple error correction with Analog Codes….Pages 239-249
On the complexity of satisfiability problems for algebraic structures (preliminary report)….Pages 250-258
A computational proof of the Noether normalization lemma….Pages 259-273
A graphics interface to REDUCE….Pages 274-296
Vlsi designs for multiplication over finite fields GF (2 m )….Pages 297-309
A primality test using cyclotomic extensions….Pages 310-323
The method of syndrome coding and its application for data compression and processing in high energy physics experiments….Pages 324-335
Nonassociative degree five identities not implied by commutativity: A computer approach….Pages 336-340
On completely regular propelinear codes….Pages 341-355
N-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros….Pages 356-376
Covering radius: Improving on the sphere-covering bound….Pages 377-385
On Goldman’s algorithm for solving first-order multinomial autonomous systems….Pages 386-395
A covering problem in the odd graphs….Pages 396-406
On the computation of Hilbert-Samuel series and multiplicity….Pages 407-414
Succinct representations of counting problems….Pages 415-426
How to guess ℓ-th roots modulo n by reducing lattice bases….Pages 427-442
A study on Imai-Hirakawa trellis-coded modulation schemes….Pages 443-453
Embedding flexible control strategies into object oriented languages….Pages 454-457
Majority decoding of large repetition codes for the r-ary symmetric channel….Pages 458-466
On binary codes of order 3….Pages 467-470
Polynomial decomposition algorithm of almost quadratic complexity….Pages 471-475
The weights of the orthogonals of certain cyclic codes or extended GOPPA codes….Pages 476-480