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

Alain Poli (Editor); G. Goos (Editor); J. Hartmanis (Editor); J. Grabowski (Editor); P. Lescanne (Editor)

ISBN 10: 3540167676 / ISBN 13: 9783540167679

Editore: Springer-Verlag, OHG, Berlin, Germany, 1986

Riguardo questo articolo

Wear/soil. W/full markings and pocket. 265 or 268 pages, numerical or Amz. Size: 8vo. Codice articolo 008282

Dati bibliografici

Titolo: Applied Algebra, Algorithmics and ...

Casa editrice: Springer-Verlag, OHG, Berlin, Germany

Data di pubblicazione: 1986

Legatura: Paperback

Condizione: Very Good

Condizione sovraccoperta: No Jacket

Edizione: 1st.

Tipologia articolo: Ex-Library

Descrizione articolo

Contenuti:

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.