Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra
Editat de Thomas Beth, Michael Clausenen Limba Engleză Paperback – 4 mai 1988
Preț: 371.93 lei
Puncte Express: 558
Preț estimativ în valută:
65.71€ • 75.51$ • 56.93£
65.71€ • 75.51$ • 56.93£
Carte tipărită la comandă
Livrare economică 06-20 mai
Specificații
ISBN-13: 9783540192008
ISBN-10: 354019200X
Pagini: 228
Ilustrații: VIII, 220 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354019200X
Pagini: 228
Ilustrații: VIII, 220 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.