Applied Algebra, Algorithmics and Error-Correcting Codes
Editat de Alain Polien Limba Engleză Paperback – iul 1986
Preț: 320.93 lei
Preț vechi: 401.17 lei
-20%
Puncte Express: 481
Preț estimativ în valută:
56.75€ • 65.08$ • 49.05£
56.75€ • 65.08$ • 49.05£
Carte tipărită la comandă
Livrare economică 28 aprilie-12 mai
Specificații
ISBN-13: 9783540167679
ISBN-10: 3540167676
Pagini: 276
Ilustrații: VIII, 268 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.42 kg
Ediția:1986
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540167676
Pagini: 276
Ilustrații: VIII, 268 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.42 kg
Ediția:1986
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
On associative algebras of minimal rank.- Construction of primitive idempotents for a variable codes.- Multivariate polynomials in coding theory.- Enumeration of self dual 2k circulant codes.- Codes, groups and invariants.- On a conjecture concerning coverings of Hamming space.- An improved upper bound on covering radius.- Association schemes and difference sets defined on two weight codes.- Automorphisms of two families of extended non binary cyclic Goppa Codes.- Some quasi-perfect cyclic codes.- Explicit Kerdock codes over GF(2).- Une classe de codes 2-correcteurs adaptes aux systems d'information formates.- LOUSTICC simulation software : Experimental results of coding systems.- An algorithm of complete decoding of double-error-correcting goppa codes.- On the number of divisors of a polynomial over GF(2).- Multivariate polynomial factoring and detection of true factors.- Discriminants and the irreducibility of a class of polynomials.- Computational aspects of reduction strategies to construct resolutions of monomial ideals.- Designs arising from symplectic geometry.- Distance — transitive graphs and the problem of maximal subgroups of symmetric groups.- Can a fast signature scheme without secret key be secure / Un Schema de Signature Courte et Rapide N'Utilisant pas de CLE Secrete Peut-IL Etre Fiable?.- Manipulation of recurrence relations in computer algebra.- Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation.