Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

1. An elementary proof of a partial improvement to the Ax-Katz Theorem

   • O. Moreno, C. J. Moreno

   Pages 257-268

2. Energy functions associated with error-correcting codes

   • C. Rentería, H. Tapia-Reculas

   Pages 269-278

3. On determining all codes in semi-simple group rings

   • Roberta Evans Sabin

   Pages 279-290

4. On hyperbolic cascaded Reed-Solomon codes

   • Keith Saints, Chris Heegard

   Pages 291-303

5. Peak-shift and bit error-correction with channel side information in runlength-limited sequences

   • Yuichi Saitoh, Ikuyo Ibe, Hideki Imai

   Pages 304-315

6. On a third order differential equation whose differential Galois group is the simple group of 168 elements

   • Michael F. Singer, Felix Ulmer

   Pages 316-324

7. Approximating the number of error locations within a constant ratio is NP-complete

   • Jacques Stern

   Pages 325-331

8. Two chosen-plaintext attacks on the Li-Wang joint authentication and encryption scheme

   • Johan van Tilburg

   Pages 332-343

9. Some constructions of perfect binary codes

   • Alexander Vardy, Tuvi Etzion

   Pages 344-354

10. Back Matter

    PDF

This volume is the proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 10),held in Puerto Rico, May 1993. The aim of the AAECC meetings is to attract high-level research papers and to encourage cross-fertilization among different areas which share the use of algebraic methods and techniques for applications in the sciences of computing, communications, and engineering. The AAECC symposia are mainly devoted to research in coding theory and computer algebra. The theoryof error-correcting codes deals with the transmission of information in the presence of noise. Coding is the systematic use of redundancy in theformation of the messages to be sent so as to enable the recovery of the information present originally after it has been corrupted by (not too much)noise. Computer algebra is devoted to the investigation of algorithms, computational methods, software systems and computer languages, oriented to scientific computations performed on exact and often symbolic data, by manipulating formal expressions by means of the algebraic rules they satisfy. Questions of complexity and cryptography are naturally linked with both coding theory and computer algebra and represent an important share of the area covered by AAECC.

• Algorithms
• Symbol
• algebra
• algorithm
• coding theory
• communication
• complexity
• computer
• computer algebra
• cryptography
• error-correcting code
• information
• combinatorics

Policies and ethics