Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15-19, 1999 Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$104.16
Used and New from Other Sellers
Used and New from Other Sellers
from $56.84
Usually ships in 1-2 business days
(Save 59%)
Other sellers (Paperback)
  • All (8) from $56.84   
  • New (6) from $56.84   
  • Used (2) from $69.95   

Overview

This book constitutes the refereed proceedings of the 19th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, held in Honolulu, Hawaii, USA in November 1999.
The 42 revised full papers presented together with six invited survey papers were carefully reviewed and selected from a total of 86 submissions. The papers are organized in sections on codes and iterative decoding, arithmetic, graphs and matrices, block codes, rings and fields, decoding methods, code construction, algebraic curves, cryptography, codes and decoding, convolutional codes, designs, decoding of block codes, modulation and codes, Gröbner bases and AG codes, and polynomials.

Read More Show Less

Product Details

  • ISBN-13: 9783540667230
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 12/10/1999
  • Series: Lecture Notes in Computer Science Series , #1719
  • Edition description: 1999
  • Edition number: 1
  • Pages: 518
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.07 (d)

Table of Contents

Invited Papers.- Codes on Graphs: A Survey for Algebraists.- RA Codes Achieve AWGN Channel Capacity.- Monomial Ideals and Planar Graphs.- A Fast Program Generator of Fast Fourier Transforms.- On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms.- Curves with Many Points and Their Applications.- Codes and Iterative Decoding.- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity.- On the Theory of Low-Density Convolutional Codes.- Combinatorics I: Arithmetic.- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.- A New Representation of Boolean Functions.- Combinatorics II: Graphs and Matrices.- An Algorithm to Compute a Nearest Point in the Lattice A n
• .- Sequences from Cocycles.- Block Codes I.- On the Second Greedy Weight for Binary Linear Codes.- On the Size of Identifying Codes.- Algebra I: Rings and Fields.- Fast Quantum Fourier Transforms for a Class of Non-abelian Groups.- Linear Codes and Rings of Matrices.- On—4-Simplex Codes and Their Gray Images.- Decoding Methods.- Some Results on Generalized Concatenation of Block Codes.- Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping.- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity.- Algebra II.- Recursive MDS-Codes and Pseudogeometries.- Strength of ISTY1 without FL Function for Higher Order Differential Attack.- Code Construction.- Quantum Reed—Solomon Codes.- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel.- Rectangular Codes and Rectangular Algebra.- Codes and Algebra I: Algebraic Curves.- Decoding Hermitian Codes with Sudan’s Algorithm.- Computing a Basis of on an affine algebraic curve with one rational place at infinit.- Cryptography.- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications.- An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement.- Codes and Decoding.- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It.- Convolutional Codes.- Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis.- Properties of Finite Response Input Sequences of Recursive Convolutional Codes.- Combinatorics III: Designs.- Lower Bounds for Group Covering Designs.- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices.- Decoding of Block Codes.- Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms.- Algebra III: Rings and Fields.- Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey).- Calculating Generators for Invariant Fields of Linear Algebraic Groups.- Constructing Elements of Large Order in Finite Fields.- Modulation and Codes.- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy.- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels.- Codes and Algebra II: Gröbner Bases and AG Codes.- A New Criterion for Normal Form Algorithms.- Discrete Fourier Transform and Gröbner Bases.- Block Codes II.- On the State Complexities of Ternary Codes.- Binary Optimal Linear Rate 1/2 Codes.- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4.- Algebra IV: Polynomials.- The Euclidean Algorithm and Primitive Polynomials over Finite Fields.- On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials.- Mastrovito Multiplier for General Irreducible Polynomials.

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)