Skip to main content
SpringerLink
Log in
Book cover

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Serdar Boztaş

    1. Department of Mathematics, RMIT University, Melbourne, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor E. Shparlinski

    1. Department of Computing, Macquarie University, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: AAECC 2001.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (40 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  3. Block Codes

    1. Self-dual Codes Using Image Restoration Techniques

      • A. Baliga, J. Chua
      Pages 46-56

    2. Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance

      • E. Cadic, J.C. Carlach, G. Olocco, A. Otmani, J.P. Tillich
      Pages 57-66

    3. F q -Linear Cyclic Codes over F q m: DFT Characterization

      • Bikash Kumar Dey, B. Sundar Rajan
      Pages 67-76

  4. Code Constructions

    1. Cyclic Projective Reed-Muller Codes

      • Thierry P. Berger, Louis de Maximy
      Pages 77-81

    2. Codes Identifying Sets of Vertices

      • Tero Laihonen, Sanna Ranto
      Pages 82-91

    3. Duality and Greedy Weights of Linear Codes and Projective Multisets

      • Hans Georg Schaathun
      Pages 92-101

  5. Codes and Algebra:Rings and Fields

    1. Type II Codes over IF2r

      • Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa
      Pages 102-111

    2. On Senary Simplex Codes

      • Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
      Pages 112-121

    3. Optimal Double Circulant Z4-Codes

      • T. Aaron Gulliver, Masaaki Harada
      Pages 122-128

    4. Constructions of Codes from Number Fields

      • Venkatesan Guruswami
      Pages 129-140

    5. On Generalized Hamming Weights for Codes over Finite Chain Rings

      • Hiroshi Horimoto, Keisuke Shiromoto
      Pages 141-150

    6. Information Rates and Weights of Codes in Structural Matrix Rings

      • Andrei Kelarev, Olga Sokratova
      Pages 151-158

  6. Codes and Algebra:Algebraic Geometry Codes

    1. On Hyperbolic Codes

      • Olav Geil, Tom Høholdt
      Pages 159-171

    2. On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes

      • Shojiro Sakata
      Pages 172-181

    3. Computing the Genus of a Class of Curves

      • M. C. Rodríguez-Palánquex, L. J. García-Villalba, I. Luengo-Velasco
      Pages 182-191
Back to top

Other volumes

  1. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Keywords

About this book

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.

Editors and Affiliations

  • Department of Mathematics, RMIT University, Melbourne, Australia

    Serdar Boztaş

  • Department of Computing, Macquarie University, Australia

    Igor E. Shparlinski

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation