Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

1. Front Matter

   PDF

2. Covering radius and writing on memories

   • Gérard D. Cohen

   Pages 1-10

3. Geometric problems solvable in single exponential time

   • Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó

   Pages 11-23

4. A description of the [16,7,6] codes

   • Juriaan Simonis

   Pages 24-35

5. Periodic sequences for absolute type shaft encoders

   • Kazuhiko Yamaguchi, Hideki Imai

   Pages 36-45

6. Error-coded algorithms for on-line arithmetic

   • George Sinaki

   Pages 46-58

7. Constructions of codes correcting burst asymmetric errors

   • Yuichi Saitoh, Hideki Imai

   Pages 59-70

8. A construction method for m-ary unidirectional error control codes

   • Tae Nam Ahn, Kohichi Sakaniwa, T. R. N. Rao

   Pages 71-85

9. Feasible calculation of the generator for combined LFSR sequences

   • Lu Peizhong, Song Guowen

   Pages 86-95

10. Substitution of characters in q-ary m-sequences

    • István Vajda, Tibor Nemetz

    Pages 96-105

11. Pseudo-polyphase orthogonal sequence sets with good cross-correlation property

    • Naoki Suehiro

    Pages 106-112

12. Real-valued bent function and its application to the design of balanced quadriphase sequences with optimal correlation properties

    • Shinya Matsufuji, Kyoki Imamura

    Pages 113-121

13. Coded modulation with generalized multiple concatenation of block codes

    • G. Schnabl, M. Bossert

    Pages 122-131

14. Trellis coded modulation based on time-varying mapping and encoders for utilizing a channel intersymbol interference

    • Ryuji Kohno, Choonsik Yim, Hideki Imai

    Pages 132-143

15. Use of the algebraic coding theory in nuclear electronics

    • N. M. Nikityuk

    Pages 144-154

16. Some ideas about fault-tolerant Chinese Remaindering

    • John Abbott

    Pages 155-163

17. On a categorial isomorphism between a class of Completely Regular Codes and a class of Distance Regular Graphs

    • Josep Rifà-Coma

    Pages 164-179

18. Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersurface

    • Joos Heintz, Marie-Francoise Roy, Pablo Solernó

    Pages 180-196

19. On the complexity of algebraic power series

    • M. E. Alonso, T. Mora, M. Raimondo

    Pages 197-207

20. Local decomposition algorithms

    • Maria Emilia Alonso, Teo Mora, Mario Raimondo

    Pages 208-221

The AAECC conferences focus on the algebraic aspects of modern computer science, which include the most up-to-date and advanced topics. The topic of error-correcting codes is one where theory and implementation are unified into a subject both of mathematical beauty and of practical importance. Algebraic algorithms are not only interesting theoretically but also important in computer and communication engineering and many other fields. This volume contains the proceedings of the 8th AAECC conference, held in Tokyo in August 1990. Researchers from Europe, America, Japan and other regions of the world presented papers at the conference. The papers present new results of recent theoretical and application-oriented research on applied algebra, algebraic algorithms and error-correcting codes.

• Algorithms
• algebra
• algorithm
• communication
• computer
• computer science
• error-correcting code
• combinatorics

Policies and ethics