Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra: 4th International Conference, AAECC-4 Karlsruhe, FRG, September 23–26, 1986 Proceedings

Thomas Beth (auth.), Thomas Beth, Michael Clausen (eds.)354019200X, 9783540192008

This volume contains the proceedings of the 4th International Conference on Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra (AAECC-4), held in Karlsruhe, 23-26 September, 1986. Selected papers which were given at the conference have been reviewed a second time and are presented here.

---

Table of contents :
A pplicable a lgebra, e rror- c orrecting c odes, combinatorics and computer algebra….Pages 1-4
From T(m) triangular graphs to single-error-correcting codes….Pages 5-12
Integration of graphical tools in a computer algebra system….Pages 13-24
Type inference using unification in computer algebra….Pages 25-28
The weight distribution of double-error-correcting goppa codes….Pages 29-42
A simple analysis of the blokh-Zyablov decoding algorithm….Pages 43-57
Design of a viterbi decoder with microprocessor-based serial implementation….Pages 58-67
On s-sum-sets (s odd) and three-weight projective codes….Pages 68-76
On the integration of numeric and algebraic computations….Pages 77-87
A symbolic manipulation system for combinatorial problems….Pages 88-97
Standard bases and non-noetherianity: Non-commutative polynomial rings….Pages 98-109
Embedding self-dual codes into projective space….Pages 110-112
The finite fourier-transform as a modular substitution….Pages 113-119
On computers and modular representations of SL n ( K )….Pages 120-129
Construction of SDMC codes over GF (2) or GF (3)….Pages 130-138
FAST16 : A software program for factorising polynomials over large GF(p)….Pages 139-156
Characterization of completely regular codes through p-polynomial association schemes….Pages 157-167
Codes on hermitian curves….Pages 168-176
Symmetries of cyclic extended goppa codes over F q ….Pages 177-194
Some bounds for the construction of Gröbner bases….Pages 195-201
Analysis of a class of algorithms for problems on trace languages….Pages 202-214