Applied Algebra, Algorithmics and Error-Correcting Codes: 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings (Lecture Notes in Computer Science, 228)

ISBN 10: 3540167676 / ISBN 13: 9783540167679

Published by Springer, 1986

About this Item

Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.

Seller Inventory # OTV.3540167676.VG

Bibliographic Details

• Title: Applied Algebra, Algorithmics and Error-Correcting Codes: 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings (Lecture Notes in Computer Science, 228)
• Publisher: Springer
• Publication Date: 1986
• Language: English
• ISBN 10: 3540167676
• ISBN 13: 9783540167679
• Binding: Soft cover
• Condition: very_good

About this title

Synopsis

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 A new approach to scientific calculation.