Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings

Overview

This book constitutes the refereed proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-14, held in Melbourne, Australia in November 2001.
The 36 revised full papers presented together with four invited papers were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections on block codes, code constructions, codes and algebra - rings and fields, codes and algebra - ...
See more details below
Paperback (2001)
$100.74
BN.com price
(Save 7%)$109.00 List Price
Other sellers (Paperback)
  • All (4) from $72.55   
  • New (3) from $72.55   
  • Used (1) from $131.98   
Sending request ...

Overview

This book constitutes the refereed proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-14, held in Melbourne, Australia in November 2001.
The 36 revised full papers presented together with four invited papers were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections on block codes, code constructions, codes and algebra - rings and fields, codes and algebra - algebraic geometry codes, sequences, cryptography, algorithms, algorithms - decoding, and algebraic constructions.
Read More Show Less

Product Details

  • ISBN-13: 9783540429111
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 12/12/2001
  • Series: Lecture Notes in Computer Science Series , #2227
  • Edition description: 2001
  • Edition number: 1
  • Pages: 404
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.85 (d)

Table of Contents

Invited Contributions.- The Ubiquity of Reed-Muller Codes.- Self-dual Codes-Theme and Variations.- Design of Differential Space-Time Codes Using Group Theory.- Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms.- Block Codes.- Self-dual Codes Using Image Restoration Techniques.- Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance.- F q -Linear Cyclic Codes over F q m: DFT Characterization.- Code Constructions.- Cyclic Projective Reed-Muller Codes.- Codes Identifying Sets of Vertices.- Duality and Greedy Weights of Linear Codes and Projective Multisets.- Codes and Algebra:Rings and Fields.- Type II Codes over IF2r.- On Senary Simplex Codes.- Optimal Double Circulant Z4-Codes.- Constructions of Codes from Number Fields.- On Generalized Hamming Weights for Codes over Finite Chain Rings.- Information Rates and Weights of Codes in Structural Matrix Rings.- Codes and Algebra:Algebraic Geometry Codes.- On Hyperbolic Codes.- On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes.- Computing the Genus of a Class of Curves.- Sequences.- Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers.- Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation.- On the Non-existence of (Almost-)Perfect Quaternary Sequences.- Maximal Periods of x2 + c in Fq.- On the Aperiodic Correlation Function of Galois Ring m-Sequences.- Euclidean Modules and Multisequence Synthesis.- Cryptography.- On Homogeneous Bent Functions.- Partially Identifying Codes for Copyright Protection.- On the Generalised Hidden Number Problem and Bit Security of XTR.- CRYPTIM: Graphs as Tools for Symmetric Encryption.- Algorithms.- An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products.- Algorithms for Large Integer Matrix Problems.- On the Identification of Vertices and Edges Using Cycles.- Algorithms:Decoding.- On Algebraic Soft Decision Decoding of Cyclic Binary Codes.- Lifting Decoding Schemes over a Galois Ring.- Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms.- A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding.- An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC.- Algebraic Constructions.- Cartan’s Characters and Stairs of Characteristic Sets.- On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2.- Algebraic Constructions for PSK Space-Time Coded Modulation.
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)