• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 15th International Symposium, Aaecc-15, Toulouse, France, May 12-16, 2003, Proceedin

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 15th International Symposium, Aaecc-15, Toulouse, France, May 12-16, 2003, Proceedin

Paperback

Series: Lecture Notes in Computer Science, Book 2643

General ComputersComputer Security

Currently unavailable to order

ISBN10: 3540401113
ISBN13: 9783540401117
Publisher: Springer Nature
Published: Apr 28 2003
Pages: 270
Weight: 1.44
Height: 0.59 Width: 8.50 Depth: 11.00
Language: English
TheAAECCsymposiumwasstartedinJune1983byAlainPoli(Toulouse), who, together with Roger Desq, Daniel Lazard, and Paul Camion, organized the ?rst conference. The meaning of the acronym AAECC changed from Applied - gebra and Error Correcting Codes to Applied Algebra, Algebraic Algorithms, and Error Correcting Codes. One reason for this was the increasing importance of complexity, particularly for decoding algorithms. During the AAECC-12 s- posium the conference committee decided to enforce the theory and practice of the coding side as well as the cryptographic aspects. Algebra was conserved, as in the past, but was slightly more oriented to algebraic geometry codes, ?nite ?elds, complexity, polynomials, and graphs. For AAECC-15 the main subjects covered were: - Block codes. - Algebra and codes: rings, ?elds, AG codes. - Cryptography. - Sequences. - Algorithms, decoding algorithms. - Algebra: constructions in algebra, Galois groups, di?erential algebra, po- nomials. The talks of the six invited speakers characterized the aims of AAECC-15: - P. Sole (Public Key Cryptosystems Based on Rings). - S. Lin (Combinatorics Low Density Parity Check Codes). - J. Stern (Cryptography and the Methodology of Provable Security). - D. Costello (Graph-Based Convolutional LDPC Codes). - I. Shparlinsky (Dynamical Systems Generated by Rational Functions). - A. Lauder (Algorithms for Multivariate Polynomials over Finite Fields).

Also in

General Computers