ISBN: 9783540167679 - applied algebra, algorithmics and error-correcting codes: 2nd international conference, aaecc-2, toulouse, france, october 1-5, 1984. proceedings: 228 (lecture notes in computer science, 228) (12 resultados)

Condición: very_good. 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.…

Condición: New.

Paperback or Softback. Condición: New. Applied Algebra, Algorithmics and Error-Correcting Codes: 2nd International Conference, Aaecc-2, Toulouse, France, October 1-5, 1984. Proceedings. Book.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Condición: Neu. Applied Algebra, Algorithmics and Error-Correcting Codes | 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings | Alain Poli | Taschenbuch | viii | Englisch | 1986 | Springer | EAN 9783540167679 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 276 pp. Englisch. …

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 coveri.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 276 pp. Englisch.…