Skip to main content
SpringerLink
Log in

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Gérard Cohen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Teo Mora
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Oscar Moreno
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 673)

Included in the following conference series:

Conference proceedings info: AAECC 1993.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Sequence based methods for data transmission and source compression

    • A. R. Calderbank, P. C. Fishburn, A. Rabinovich
    Pages 1-12

  3. On the apparent duality of the Kerdock and Preparata codes

    • A. Roger Hammons Jr., P. Vijay Kumar, A. R. Calderbank, N. J. A. Sloane, Patrick Solé
    Pages 13-24

  4. Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials

    • Vladimir Levenshtein
    Pages 25-42

  5. Systems of algebraic equations solved by means of endomorphisms

    • H. Michael Möller
    Pages 43-56

  6. Criteria for sequence set design in CDMA communications

    • Robert A. Scholtz
    Pages 57-65

  7. Using Groebner bases to determine the algebraic and transcendental nature of field extensions: Return of the killer tag variables

    • Moss Sweedler
    Pages 66-75

  8. A “Divide and conquer” algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals

    • Anna Maria Bigatti, Pasqualina Conti, Lorenzo Robbiano, Carlo Traverso
    Pages 76-88

  9. An efficient algorithm for the sparse mixed resultant

    • John Canny, Ioannis Emiris
    Pages 89-104

  10. Some features of binary block codes for correcting asymmetric errors

    • G. Fang, H. C. A. van Tilborg, F. W. Sun, I. S. Honkala
    Pages 105-120

  11. Fixed-parameter complexity and cryptography

    • Michael R. Fellows, Neal Koblitz
    Pages 121-131

  12. A class of algebraic geometric codes from curves in high-dimensional projective spaces

    • G. L. Feng, T. R. N. Rao
    Pages 132-146

  13. A new class of sequences: Mapping sequences

    • Guang Gong
    Pages 147-161

  14. A zero-test and an interpolation algorithm for the shifted sparse polynomials

    • Dima Grigoriev, Marek Karpinski
    Pages 162-169

  15. Parallelization of quantifier elimination on a workstation network

    • Hoon Hong
    Pages 170-179

  16. Hyperplane sections of fermat varieties in P 3 in char. 2 and some applications to cyclic codes

    • H. Janwa, R. M. Wilson
    Pages 180-194

  17. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems

    • Erich Kaltofen
    Pages 195-212

  18. Relations among Lie formal series and construction of symplectic integrators

    • P. -V. Koseleff
    Pages 213-230

  19. Exponential sums as discrete fourier transform with invariant phase functions

    • Gilles Lachaud
    Pages 231-243

  20. Application of finite fields to memory interleaving

    • Abraham Lempel, Gadiel Seroussi
    Pages 244-256
Back to top

Other volumes

  1. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation