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 / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$91.56
Used and New from Other Sellers
Used and New from Other Sellers
from $79.70
Usually ships in 1-2 business days
(Save 26%)
Other sellers (Paperback)
  • All (3) from $79.70   
  • New (3) from $79.70   

Overview

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.

Read More Show Less

Product Details

  • ISBN-13: 9783540566861
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 5/21/1993
  • Series: Lecture Notes in Computer Science Series , #673
  • Edition description: 1993
  • Edition number: 1
  • Pages: 362
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.77 (d)

Table of Contents

Sequence based methods for data transmission and source compression.- On the apparent duality of the Kerdock and Preparata codes.- Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials.- Systems of algebraic equations solved by means of endomorphisms.- Criteria for sequence set design in CDMA communications.- Using Groebner bases to determine the algebraic and transcendental nature of field extensions: Return of the killer tag variables.- A “Divide and conquer” algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals.- An efficient algorithm for the sparse mixed resultant.- Some features of binary block codes for correcting asymmetric errors.- Fixed-parameter complexity and cryptography.- A class of algebraic geometric codes from curves in high-dimensional projective spaces.- A new class of sequences: Mapping sequences.- A zero-test and an interpolation algorithm for the shifted sparse polynomials.- Parallelization of quantifier elimination on a workstation network.- Hyperplane sections of fermat varieties in P 3 in char. 2 and some applications to cyclic codes.- Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems.- Relations among Lie formal series and construction of symplectic integrators.- Exponential sums as discrete fourier transform with invariant phase functions.- Application of finite fields to memory interleaving.- An elementary proof of a partial improvement to the Ax-Katz Theorem.- Energy functions associated with error-correcting codes.- On determining all codes in semi-simple group rings.- On hyperbolic cascaded Reed-Solomon codes.- Peak-shift and bit error-correction with channel side information in runlength-limited sequences.- On a third order differential equation whose differential Galois group is the simple group of 168 elements.- Approximating the number of error locations within a constant ratio is NP-complete.- Two chosen-plaintext attacks on the Li-Wang joint authentication and encryption scheme.- Some constructions of perfect binary codes.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)