Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

1. Front Matter

   Pages I-XIII

   PDF

2. Invited Papers

   1. Codes on Graphs: A Survey for Algebraists

      • G. David Forney Jr.

      Pages 1-9

   2. RA Codes Achieve AWGN Channel Capacity

      • Hui Jin, Robert J. McEliece

      Pages 10-18

   3. Monomial Ideals and Planar Graphs

      • Ezra Miller, Bernd Sturmfels

      Pages 19-28

   4. A Fast Program Generator of Fast Fourier Transforms

      • Michael Clausen, Meinard Müller

      Pages 29-42

   5. On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms

      • Tadao Kasami

      Pages 43-54

   6. Curves with Many Points and Their Applications

      • Ian F. Blake

      Pages 55-64

3. Codes and Iterative Decoding

   1. New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity

      • M. Amin Shokrollahi

      Pages 65-76

   2. On the Theory of Low-Density Convolutional Codes

      • Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov

      Pages 77-86

4. Combinatorics I: Arithmetic

   1. On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders

      • Frances Griffin, Harald Niederreiter, Igor E. Shparlinski

      Pages 87-93

   2. A New Representation of Boolean Functions

      • Claude Carlet, Philippe Guillot

      Pages 94-103

5. Combinatorics II: Graphs and Matrices

   1. An Algorithm to Compute a Nearest Point in the Lattice A ^* _n

      • I. Vaughan, L. Clarkson

      Pages 104-120

   2. Sequences from Cocycles

      • Kathy J. Horadam

      Pages 121-130

6. Block Codes I

   1. On the Second Greedy Weight for Binary Linear Codes

      • Wende Chen, Torleiv Kløve

      Pages 131-141

   2. On the Size of Identifying Codes

      • Uri Blass, Iiro Honkala, Simon Litsyn

      Pages 142-147

7. Algebra I: Rings and Fields

   1. Fast Quantum Fourier Transforms for a Class of Non-abelian Groups

      • Markus Püschel, Martin Rötteler, Thomas Beth

      Pages 148-159

   2. Linear Codes and Rings of Matrices

      • M. Greferath, S. E. Schmidt

      Pages 160-169

   3. On ℤ4-Simplex Codes and Their Gray Images

      • Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal

      Pages 170-179

8. Decoding Methods

   1. Some Results on Generalized Concatenation of Block Codes

      • M. Bossert, H. Grießer, J. Maucher, V. V. Zyablov

      Pages 181-190

   2. Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping

      • Qi Wang, Lei Wei, Rodney A. Kennedy

      Pages 191-200

This book constitutes the refereed proceedings of the 19th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, held in Honolulu, Hawaii, USA in November 1999.
The 42 revised full papers presented together with six invited survey papers were carefully reviewed and selected from a total of 86 submissions. The papers are organized in sections on codes and iterative decoding, arithmetic, graphs and matrices, block codes, rings and fields, decoding methods, code construction, algebraic curves, cryptography, codes and decoding, convolutional codes, designs, decoding of block codes, modulation and codes, Gröbner bases and AG codes, and polynomials.

• Algebraic Algorithms
• Algebraic Codes
• Algebraic Curves
• Block Codes
• Combinatorial Computations
• Cryptographic Codes
• Decoding Algorithms
• Error-Correcting Codes
• Groebner Bases
• Polynomials
• algebra
• algorithms
• code
• error-correcting code
• algorithm analysis and problem complexity

• Department of Electrical Engineering, University of Hawaii, Honolulu, USA

  Marc Fossorier, Shu Lin

• Institute of Industrial Science, University of Tokyo, Minato-ku, Japan

  Hideki Imai

• AAECC/IRIT, Université Paul Sabatier, Toulouse, France

  Alain Poli

Policies and ethics