Abstract is missing.
- Codes on Graphs: A Survey for AlgebraistsG. David Forney Jr.. 1-9
- RA Codes Achieve AWGN Channel CapacityHui Jin, Robert J. McEliece. 10-18
- Monomial Ideals and Planar GraphsEzra Miller, Bernd Sturmfels. 19-28
- A Fast Program Generator of Fast Fourier TransformsMichael Clausen, Meinard Müller. 29-42
- On Integer Programming Problems Related to Soft-Decision Iterative Decoding AlgorithmsTadao Kasami. 43-54
- Curves with Many Points and Their ApplicationsIan F. Blake. 55-64
- New Sequences of Linear Time Erasure Codes Approaching the Channel CapacityMohammad Amin Shokrollahi. 65-76
- On the Theory of Low-Density Convolutional CodesKarin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov. 77-86
- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher OrdersFrances Griffin, Harald Niederreiter, Igor Shparlinski. 87-93
- A New Representation of Boolean FunctionsClaude Carlet, Philippe Guillot. 94-103
- An Algorithm to Compute a Nearest Point in the Lattice A::n:::::*:::I. Vaughan, L. Clarkson. 104-120
- Sequences from CyclesKathy J. Horadam. 121-130
- On the Second Greedy Weight for Binary Linear CodesWende Chen, Torleiv Kløve. 131-141
- On tHe Size of Identifying CodesUri Blass, Iiro S. Honkala, Simon Litsyn. 142-147
- Fast Quantum Fourier Transforms for a Class of Non-Abelian GroupsMarkus Püschel, Martin Rötteler, Thomas Beth. 148-159
- Linear Codes and Rings of MatricesMarcus Greferath, Stefan E. Schmidt. 160-169
- On Z::4::-Simplex Codes and Their Gray ImagesMahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal. 170-180
- Some Results on Generalized Concatenation of Block CodesMartin Bossert, Helmut Grießer, Johannes Maucher, Victor V. Zyablov. 181-190
- Near Optimal Decoding for TCM Using the BIVA and Trellis ShapingQi Wang, Lei Wei, Rodney A. Kennedy. 191-200
- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational ComplexityYuansheng Tang, Tadao Kasami, Toru Fujiwara. 201-210
- Recursive MDS-Codes and PseudogeometriesElena Couselo, Santos González, Viktor T. Markov, Alexander A. Nechaev. 211-220
- Strenght of MISTY1 without FL Function for Higher Order Differential AttackHidema Tanaka, Kazuyuki Hisamatsu, Toshinobu Kaneko. 221-230
- Quantum Reed-Solomon CodesMarkus Grassl, Willi Geiselmann, Thomas Beth. 231-244
- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited ChannelZsigmond Nagy, Kenneth Zeger. 245-251
- Rectangular Codes and Rectangular AlgebraVladimir Sidorenko, Johannes Maucher, Martin Bossert. 252-259
- Decoding Hermitian Codes with Sudan s AlgorithmTom Høholdt, Rasmus Refslund Nielsen. 260-270
- Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at InfinityRyutaroh Matsumoto, Shinji Miura. 271-281
- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic ApplicationsMarc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai. 282-293
- An Authetnication Scheme over Non-Authentic Public Channel in Information-Theoretic Secret-Key AgreementShengli Liu, YuMin Wang. 294-301
- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on ItShojiro Sakata, Masazumi Kurihara. 302-313
- Computing Weight Distributions of Convolutional Codes via Shift Register SynthesisMehul Motani, Chris Heegard. 314-323
- Properties of Finite Response Input Sequences of Recursive Convolutional CodesDidier Le Ruyet, Hong Sun, Han Vu Thien. 324-333
- Lower Bounds for Group Covering DesignsK. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal. 334-345
- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard MatricesGarry Hughes. 346-354
- Double Circulant Self-Dual Codes Using Finite-Field Wavelet TransformsFaramarz Fekri, Steven W. McLaughlin, Russell M. Mersereau, Ronald W. Schafer. 355-364
- Linear Codes and Polylinear Recurrences over Finite Rings and ModulesV. L. Kurakin, Alexey S. Kuzmin, Viktor T. Markov, Alexander V. Mikhalev, Alexander A. Nechaev. 365-391
- Calculating Generators for Invariant Fields of Linear Algebraic GroupsJörn Müller-Quade, Thomas Beth. 392-403
- Constructing Elements of Large Order in Finite FieldsJoachim von zur Gathen, Igor Shparlinski. 404-409
- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary EnergySerdar Boztas. 410-419
- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK KernelsMatthew G. Parker. 420-429
- A New Criterion for Normal Form AlgorithmsBernard Mourrain. 430-443
- Discrete Fourier Transform and Gröbner BasesAlain Poli, M. C. Gennero, D. Xin. 444-453
- On the State Complexities of Ternary CodesSylvia B. Encheva, Gérard D. Cohen. 454-461
- Binary Optimal Linear Rate 1/2 CodesKoichi Betsumiya, T. Aaron Gulliver, Masaaki Harada. 462-471
- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4Patric R. J. Östergård. 472-481
- The Euclidean Algorithm and Primitive Polypomials over Finite FieldsJames W. Bond, Stefan Hui, Hank Schmidt. 482-491
- On the Computational Hardness of Testing Square-Freeness of Sparse PolynomialsMarek Karpinski, Igor Shparlinski. 492-497
- Mastrovito Multiplier for General Irreducible PolynomialsAlper Halbutogullari, Çetin Kaya Koç. 498-507