Applied Algebra, Algorithmics and Error-Correcting Codes (eBook)

2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings
Artikelnummer: 978-3-540-38813-5
Einband: PDF
Verfügbarkeit: Noch nicht erschienen, April 2027
CHF 59.00

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.

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.

Schreiben Sie Ihre eigene Bewertung
  • Nur registrierte Benutzer können Produkte bewerten
*
*
Schlecht
Sehr gut
*
*
*
*
VerlagSpringer Berlin Heidelberg
EinbandPDF
Erscheinungsjahr2005
Seitenangabe268 S.
AusgabekennzeichenEnglisch / Französisch
AbbildungenVIII, 268 p.
Auflage1986
PlattformPDF
ReiheLecture Notes in Computer Science
AutorPoli, Alain (Hrsg.)

Alle Bände der Reihe "Lecture Notes in Computer Science"

Weitere Titel von Alain (Hrsg.) Poli

Produktbewertungen
Nur registrierte Benutzer können Produkte bewerten