Abstract is missing.
- Covering Radius and Writing on MemoriesGérard D. Cohen. 1-10
- Geometric Problems Solvable in Single Exponential TimeJoos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó. 11-23
- A Description of the [16, 7, 6] CodesJuriaan Simonis. 24-35
- Periodic Sequences for Absolute Type Shaft EncodersKazuhiko Yamaguchi, Hideki Imai. 36-45
- Error-Coded Algorithms for On-Line ArithmeticGeorge Sinaki. 46-58
- Constructions of Codes Correcting Burst Asymmetric ErrorsYuichi Saitoh, Hideki Imai. 59-70
- A Construction Method for ::::m::::-ary Unidirectional Error Control CodesTae Nam Ahn, Kohichi Sakaniwa, T. R. N. Rao. 71-85
- Feasible Calculation of the Generator for Combined LFSR SequencesPeizhong Lu, Song Guowen. 86-95
- Substitution of Characters in ::::q::::-ary ::::m::::-SequencesIstván Vajda, Tibor O. H. Nemetz. 96-105
- Pseudo-Polyphase Orthogonal Sequence Sets with Good Cross-Correlation PropertyNaoki Suehiro. 106-112
- Real-Valued Bent Function and Its Application to the Design of Balanced Quadriphase Sequences with Optimal Correlation PropertiesShinya Matsufuji, Kyoki Imamura. 113-121
- Coded Modulation with Generalized Multiple Concatenation of Block CodesG. Schnabl, Martin Bossert. 122-131
- Trellis Coded Modulation Based on Time-Varying Mapping and Encoders for Utilitzing a Channel Intersymbol InterferenceRyuji Kohno, Choonsik Yim, Hideki Imai. 132-143
- Use of the Algebraic Coding Theory in Nuclear ElectronicsN. M. Nikityuk. 144-154
- Some Ideas about Fault-Tolerant Chinese RemainderingJohn Abbott. 155-163
- On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular GraphsJosep Rifà-Coma. 164-179
- Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded HypersurfaceJoos Heintz, Marie-Françoise Roy, Pablo Solernó. 180-196
- On the Complexity of Algebraic Power SeriesMaria Emilia Alonso, Teo Mora, Mario Raimondo. 197-207
- Local Decomposition AlgorithmsMaria Emilia Alonso, Teo Mora, Mario Raimondo. 208-221
- An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD s over an Algebraic Number FieldLars Langemyr. 222-233
- Some Algebra with Formal MatricesBernard Mourrain. 234-248
- Implicitization of Rational Parametric Curves and SurfacesMichael Kalkbrenner. 249-259
- An Inequality about Irreducible Factors of Integer Polynominals (II)Philippe H. Glesser, Maurice Mignotte. 260-266
- The Symplectic Trilinear Mappings: An Algorithmic Approach of the Classification; Case of the Field GF(3)Pr. L. Beneteau. 267-279
- A Gröbner Basis and a Minimal Polynominal Set of a Finite ::::n::::D ArrayShojiro Sakata. 280-291
- Bounds for Degrees and Number of Elements in Gröbner BasesLorenzo Robbiano. 292-303
- Standard Bases of Differential IdealsFrançois Ollivier. 304-321
- Complexity of Standard Bases in Projective Dimension Zero IIMarc Giusti. 322-328
- Systolic Architectures for Multiplication over Finite Field GF(2:::m:::)Menouer Diab. 329-340
- PARSAC-2: A Parallel SAC-2 Based on ThreadsWolfgang Küchlin. 341-353
- Exponetiation in Finite Fields Using Dual Basis MultiplierMasakatu Morii, Yuzo Takamatsu. 354-366
- Applications of Cayley GraphsGene Cooperman, Larry Finkelstein, N. Sarawagi. 367-378
- Duality between Two Cryptographic PrimitivesYuliang Zheng, Tsutomu Matsumoto, Hideki Imai. 379-390