Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings

  • Serdar Boztaş
  • Igor E. Shparlinski
Conference proceedings AAECC 2001

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2227)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Invited Contributions

  3. Block Codes

    1. Bikash Kumar Dey, B. Sundar Rajan
      Pages 67-76
  4. Code Constructions

    1. Thierry P. Berger, Louis de Maximy
      Pages 77-81
    2. Tero Laihonen, Sanna Ranto
      Pages 82-91
  5. Codes and Algebra:Rings and Fields

    1. Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa
      Pages 102-111
    2. Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
      Pages 112-121
    3. T. Aaron Gulliver, Masaaki Harada
      Pages 122-128
    4. Venkatesan Guruswami
      Pages 129-140
    5. Hiroshi Horimoto, Keisuke Shiromoto
      Pages 141-150
    6. Andrei Kelarev, Olga Sokratova
      Pages 151-158
  6. Codes and Algebra:Algebraic Geometry Codes

    1. Olav Geil, Tom Høholdt
      Pages 159-171
    2. M. C. Rodríguez-Palánquex, L. J. García-Villalba, I. Luengo-Velasco
      Pages 182-191
  7. Sequences

    1. Jaime Gutierrez, Domingo Gomez-Perez
      Pages 192-199
    2. A. Peinado, F. Montoya, J. Muñoz, A.J. Yuste
      Pages 219-228
  8. Cryptography

    1. Chris Charnes, Martin Rötteler, Thomas Beth
      Pages 249-259
    2. Sylvia Encheva, Gérard Cohen
      Pages 260-267
  9. Algorithms

    1. V. Álvarez, J.A. Armario, M.D. Frau, P. Real
      Pages 287-296
    2. Mark Giesbrecht, Michael Jr. Jacobson, Arne Storjohann
      Pages 297-307
    3. Iiro Honkala, Mark G. Karpovsky, Simon Litsyn
      Pages 308-314
  10. Algorithms:Decoding

  11. Algebraic Constructions

    1. François Boulier, Sylvain Neut
      Pages 363-372
    2. Andrew M. Guidi, Alex J. Grant, Steven S. Pietrobon
      Pages 387-396
  12. Back Matter
    Pages 397-398

About these proceedings


The AAECC Symposia Series was started in 1983 by Alain Poli (Toulouse), who, together with R. Desq, D. Lazard, and P. Camion, organized the ?rst conference. Originally the acronym AAECC meant “Applied Algebra and Error-Correcting Codes”. Over the years its meaning has shifted to “Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes”, re?ecting the growing importance of complexity in both decoding algorithms and computational algebra. AAECC aims to encourage cross-fertilization between algebraic methods and their applications in computing and communications. The algebraic orientation is towards ?nite ?elds, complexity, polynomials, and graphs. The applications orientation is towards both theoretical and practical error-correction coding, and, since AAECC 13 (Hawaii, 1999), towards cryptography. AAECC was the ?rst symposium with papers connecting Gr¨obner bases with E-C codes. The balance between theoretical and practical is intended to shift regularly; at AAECC-14 the focus was on the theoretical side. The main subjects covered were: – Codes: iterative decoding, decoding methods, block codes, code construction. – Codes and algebra: algebraic curves, Gr¨obner bases, and AG codes. – Algebra: rings and ?elds, polynomials. – Codes and combinatorics: graphs and matrices, designs, arithmetic. – Cryptography. – Computational algebra: algebraic algorithms. – Sequences for communications.


Algebraic Algorithms Algebraic Codes Algebraic Curves Block Codes Code Computational Algebra Computational Combinatorics Computeralgebra Cryptographic Codes Decoding Algorithms Error-correcting Code Information algorithms complexity cryptography

Editors and affiliations

  • Serdar Boztaş
    • 1
  • Igor E. Shparlinski
    • 2
  1. 1.Department of MathematicsRMIT UniversityMelbourneAustralia
  2. 2.Department of ComputingMacquarie UniversityAustralia

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42911-1
  • Online ISBN 978-3-540-45624-7
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site