
Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra
4th International Conference, AAECC-4, Karlsruhe, FRG, September 23-26, 1986. Proceedings
Springer (Publisher)
Published on 4. May 1988
Book
Paperback/Softback
VIII, 220 pages
978-3-540-19200-8 (ISBN)
Description
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.
More details
Series
Edition
1988 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 220 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 13 mm
Weight
353 gr
ISBN-13
978-3-540-19200-8 (9783540192008)
DOI
10.1007/BFb0039172
Schweitzer Classification
Content
Applicable algebra, error-correcting codes, combinatorics and computer algebra.- From T(m) triangular graphs to single-error-correcting codes.- Integration of graphical tools in a computer algebra system.- Type inference using unification in computer algebra.- The weight distribution of double-error-correcting goppa codes.- A simple analysis of the blokh-Zyablov decoding algorithm.- Design of a viterbi decoder with microprocessor-based serial implementation.- On s-sum-sets (s odd) and three-weight projective codes.- On the integration of numeric and algebraic computations.- A symbolic manipulation system for combinatorial problems.- Standard bases and non-noetherianity: Non-commutative polynomial rings.- Embedding self-dual codes into projective space.- The finite fourier-transform as a modular substitution.- On computers and modular representations of SL n (K).- Construction of SDMC codes over GF (2) or GF (3).- FAST16 : A software program for factorising polynomials over large GF(p).- Characterization of completely regular codes through p-polynomial association schemes.- Codes on hermitian curves.- Symmetries of cyclic extended goppa codes over Fq.- Some bounds for the construction of Gröbner bases.- Analysis of a class of algorithms for problems on trace languages.