| Invited Talks | |
| Codes on Graphs: A Survey for Algebraists | p. 1 |
| RA Codes Achieve AWGN Channel Capacity | p. 10 |
| Monomial Ideals and Planar Graphs | p. 19 |
| A Fast Program Generator of Fast Fourier Transforms | p. 29 |
| On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms | p. 43 |
| Curves with Many Points and Their Applications | p. 55 |
| Codes and Iterative Decoding | |
| New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity | p. 65 |
| On the Theory of Low-Density Convolutional Codes | p. 77 |
| Combinatorics I: Arithmetic | |
| On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders | p. 87 |
| A New Representation of Boolean Functions | p. 94 |
| Combinatorics II: Graphs and Matrices | |
| An Algorithm to Compute a Nearest Point in the Lattice <$>A_n^{\ast}<$> | p. 104 |
| Sequences from Cocycles | p. 121 |
| Block Codes I | |
| On the Second Greedy Weight for Binary Linear Codes | p. 131 |
| On the Size of Identifying Codes | p. 142 |
| Algebra I: Rings and Fields | |
| Fast Quantum Fourier Transforms for a Class of Non-abelian Groups | p. 148 |
| Linear Codes and Rings of Matrices | p. 160 |
| On <$>{\op Z}_4<$>-Simplex Codes and Their Gray Images | p. 170 |
| Decoding Methods | |
| Some Results on Generalized Concatenation of Block Codes | p. 181 |
| Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping | p. 191 |
| An Optimality Testing Algorithm for a Decoded Codeword of Binary BlockCodes and Its Computational Complexity | p. 201 |
| Algebra II | |
| Recursive MDS-Codes and Pseudogeometries | p. 211 |
| Strength of MISTY1 without FL Function for Higher Order Differential Attack | p. 221 |
| Code Construction | |
| Quantum Reed-Solomon Codes | p. 231 |
| Capacity Bounds for the 3-Dimensional (0,1) Runlength Limited Channel | p. 245 |
| Rectangular Codes and Rectangular Algebra | p. 252 |
| Codes and Algebra I: Algebraic Curves | |
| Decoding Hermitian Codes with Sudan's Algorithm | p. 260 |
| Computing a Basis of <$>\cal {L}<$>(D) on an Affine Algebraic Curve with One Rational Place at Infinity | p. 271 |
| Cryptography | |
| Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications | p. 282 |
| An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement | p. 294 |
| Codes and Decoding | |
| A Systolic Array Architecture for Fast Decoding of One-Point AG Codesand Scheduling of Parallel Processing on It | p. 302 |
| Convolutional Codes | |
| Computing Weight Distributions of Convolutional Codes via Shift Register Synthesis | p. 314 |
| Properties of Finite Response Input Sequences of Recursive Convolutional Codes | p. 324 |
| Combinatorics III: Designs | |
| Lower Bounds for Group Covering Designs | p. 334 |
| Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices | p. 346 |
| Decoding of Block Codes | |
| Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms | p. 355 |
| Algebra III: Rings and Fields | |
| Linear Codes and Polylinear Recurrences over Finite Rings and Modules (a Survey) | p. 365 |
| Calculating Generators for Invariant Fields of Linear Algebraic Groups | p. 392 |
| Constructing Elements of Large Order in Finite Fields | p. 404 |
| Modulation and Codes | |
| New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy | p. 410 |
| Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels | p. 420 |
| Codes and Algebra II: Gröbner Bases and AG Codes | |
| A New Criterion for Normal Form Algorithms | p. 430 |
| Discrete Fourier Transform and Gröbner Bases | p. 444 |
| Block Codes II | |
| On the State Complexities of Ternary Codes | p. 454 |
| Binary Optimal Linear Rate 1/2 Codes | p. 462 |
| On Binary/Ternary Error-Correcting Codes with Minimum Distance 4 | p. 472 |
| Algebra IV: Polynomials | |
| The Euclidean Algorithm and Primitive Polynomials over Finite Fields | p. 482 |
| On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials | p. 492 |
| Mastrovito Multiplier for General Irreducible Polynomials | p. 498 |
| Author Index | p. 509 |
| Table of Contents provided by Publisher. All Rights Reserved. |