Cantitate/Preț
Produs

Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra: 4th International Conference, AAECC-4, Karlsruhe, FRG, September 23-26, 1986. Proceedings: Lecture Notes in Computer Science, cartea 307

Editat de Thomas Beth, Michael Clausen
en Limba Engleză Paperback – 4 mai 1988
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 37660 lei

Nou

Puncte Express: 565

Preț estimativ în valută:
7209 7559$ 5956£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540192008
ISBN-10: 354019200X
Pagini: 228
Ilustrații: VIII, 220 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:1988
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.