13. AAECC 1999: Honolulu, Hawaii, USA

Marc P. C. Fossorier, Hideki Imai, Shu Lin, Alain Poli (Eds.): Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings. Lecture Notes in Computer Science 1719 Springer 1999, ISBN 3-540-66723-7

Invited Talks

G. David Forney Jr.:
Codes on Graphs: A Survey for Algebraists. 1-9
Hui Jin, Robert J. McEliece:
RA Codes Achieve AWGN Channel Capacity. 10-18
Ezra Miller, Bernd Sturmfels:
Monomial Ideals and Planar Graphs. 19-28
Michael Clausen, Meinard Müller:
A Fast Program Generator of Fast Fourier Transforms. 29-42
Tadao Kasami:
On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms. 43-54
Ian F. Blake:
Curves with Many Points and Their Applications. 55-64

Mohammad Amin Shokrollahi:
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity. 65-76
Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov:
On the Theory of Low-Density Convolutional Codes. 77-86

Frances Griffin, Harald Niederreiter, Igor Shparlinski:
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. 87-93
Claude Carlet, Philippe Guillot:
A New Representation of Boolean Functions. 94-103

I. Vaughan, L. Clarkson:
An Algorithm to Compute a Nearest Point in the Lattice A_n^*. 104-120
Kathy J. Horadam:
Sequences from Cycles. 121-130

Wende Chen, Torleiv Kløve:
On the Second Greedy Weight for Binary Linear Codes. 131-141
Uri Blass, Iiro S. Honkala, Simon Litsyn:
On tHe Size of Identifying Codes. 142-147

Markus Püschel, Martin Rötteler, Thomas Beth:
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups. 148-159
Marcus Greferath, Stefan E. Schmidt:
Linear Codes and Rings of Matrices. 160-169
Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal:
On Z₄-Simplex Codes and Their Gray Images. 170-180

Martin Bossert, Helmut Grießer, Johannes Maucher, Victor V. Zyablov:
Some Results on Generalized Concatenation of Block Codes. 181-190
Qi Wang, Lei Wei, Rodney A. Kennedy:
Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping. 191-200
Yuansheng Tang, Tadao Kasami, Toru Fujiwara:
An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity. 201-210

Elena Couselo, Santos González, Viktor T. Markov, Alexander A. Nechaev:
Recursive MDS-Codes and Pseudogeometries. 211-220
Hidema Tanaka, Kazuyuki Hisamatsu, Toshinobu Kaneko:
Strenght of MISTY1 without FL Function for Higher Order Differential Attack. 221-230

Markus Grassl, Willi Geiselmann, Thomas Beth:
Quantum Reed-Solomon Codes. 231-244
Zsigmond Nagy, Kenneth Zeger:
Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel. 245-251
Vladimir Sidorenko, Johannes Maucher, Martin Bossert:
Rectangular Codes and Rectangular Algebra. 252-259

Tom Høholdt, Rasmus Refslund Nielsen:
Decoding Hermitian Codes with Sudan's Algorithm. 260-270
Ryutaroh Matsumoto, Shinji Miura:
Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at Infinity. 271-281

Marc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai:
Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications. 282-293
Shengli Liu, Yumin Wang:
An Authetnication Scheme over Non-Authentic Public Channel in Information-Theoretic Secret-Key Agreement. 294-301

Shojiro Sakata, Masazumi Kurihara:
A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It. 302-313

Mehul Motani, Chris Heegard:
Computing Weight Distributions of Convolutional Codes via Shift Register Synthesis. 314-323
Didier Le Ruyet, Hong Sun, Han Vu Thien:
Properties of Finite Response Input Sequences of Recursive Convolutional Codes. 324-333

K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal:
Lower Bounds for Group Covering Designs. 334-345
Garry Hughes:
Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices. 346-354

Faramarz Fekri, Steven W. McLaughlin, Russell M. Mersereau, Ronald W. Schafer:
Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms. 355-364

V. L. Kurakin, Alexey S. Kuzmin, Viktor T. Markov, Alexander V. Mikhalev, Alexander A. Nechaev:
Linear Codes and Polylinear Recurrences over Finite Rings and Modules. 365-391
Jörn Müller-Quade, Thomas Beth:
Calculating Generators for Invariant Fields of Linear Algebraic Groups. 392-403
Joachim von zur Gathen, Igor Shparlinski:
Constructing Elements of Large Order in Finite Fields. 404-409

Serdar Boztas:
New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy. 410-419
Matthew G. Parker:
Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. 420-429

Bernard Mourrain:
A New Criterion for Normal Form Algorithms. 430-443
Alain Poli, M. C. Gennero, D. Xin:
Discrete Fourier Transform and Gröbner Bases. 444-453

Sylvia B. Encheva, Gérard D. Cohen:
On the State Complexities of Ternary Codes. 454-461
Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada:
Binary Optimal Linear Rate 1/2 Codes. 462-471
Patric R. J. Östergård:
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4. 472-481

James W. Bond, Stefan Hui, Hank Schmidt:
The Euclidean Algorithm and Primitive Polypomials over Finite Fields. 482-491
Marek Karpinski, Igor Shparlinski:
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. 492-497
Alper Halbutogullari, Çetin Kaya Koç:
Mastrovito Multiplier for General Irreducible Polynomials. 498-507