Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Algebraic Coding Theory and Information Theory
 
Edited by: A. Ashikhmin Bell Labs, Lucent Technologies, Murray Hill, NJ
A. Barg University of Maryland, College Park, MD
A co-publication of the AMS and DIMACS
Algebraic Coding Theory and Information Theory
Hardcover ISBN:  978-0-8218-3626-2
Product Code:  DIMACS/68
List Price: $103.00
MAA Member Price: $92.70
AMS Member Price: $82.40
eBook ISBN:  978-1-4704-4025-1
Product Code:  DIMACS/68.E
List Price: $97.00
MAA Member Price: $87.30
AMS Member Price: $77.60
Hardcover ISBN:  978-0-8218-3626-2
eBook: ISBN:  978-1-4704-4025-1
Product Code:  DIMACS/68.B
List Price: $200.00 $151.50
MAA Member Price: $180.00 $136.35
AMS Member Price: $160.00 $121.20
Algebraic Coding Theory and Information Theory
Click above image for expanded view
Algebraic Coding Theory and Information Theory
Edited by: A. Ashikhmin Bell Labs, Lucent Technologies, Murray Hill, NJ
A. Barg University of Maryland, College Park, MD
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-3626-2
Product Code:  DIMACS/68
List Price: $103.00
MAA Member Price: $92.70
AMS Member Price: $82.40
eBook ISBN:  978-1-4704-4025-1
Product Code:  DIMACS/68.E
List Price: $97.00
MAA Member Price: $87.30
AMS Member Price: $77.60
Hardcover ISBN:  978-0-8218-3626-2
eBook ISBN:  978-1-4704-4025-1
Product Code:  DIMACS/68.B
List Price: $200.00 $151.50
MAA Member Price: $180.00 $136.35
AMS Member Price: $160.00 $121.20
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 682005; 177 pp
    MSC: Primary 94

    Collected here are papers that were presented at or inspired by the DIMACS workshop, Algebraic Coding Theory and Information Theory (Rutgers University, Piscataway, NJ). Among the topics discussed are universal data compression, graph theoretical ideas in the construction of codes and lattices, decoding algorithms, and computation of capacity in various communications schemes. The book is suitable for graduate students and researchers interested in coding and information theory.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

    Readership

    Graduate students and research mathematicians interested in coding and information theory.

  • Table of Contents
     
     
    • Chapters
    • Fountain codes for lossless data compression
    • Applications of coding theory to universal lossless source coding performance bounds
    • Expander graphs and codes
    • Multilevel expander codes
    • Low density parity check lattices based on construction $D^\prime $ and cycle-free Tanner graphs
    • Sparse factor graph representations of Reed-Solomon and related codes
    • Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes
    • On the capacity of two-dimensional weight-constrained memories
    • On networks of two-way channels
    • A new approach to the design of digital communication systems
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 682005; 177 pp
MSC: Primary 94

Collected here are papers that were presented at or inspired by the DIMACS workshop, Algebraic Coding Theory and Information Theory (Rutgers University, Piscataway, NJ). Among the topics discussed are universal data compression, graph theoretical ideas in the construction of codes and lattices, decoding algorithms, and computation of capacity in various communications schemes. The book is suitable for graduate students and researchers interested in coding and information theory.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

Readership

Graduate students and research mathematicians interested in coding and information theory.

  • Chapters
  • Fountain codes for lossless data compression
  • Applications of coding theory to universal lossless source coding performance bounds
  • Expander graphs and codes
  • Multilevel expander codes
  • Low density parity check lattices based on construction $D^\prime $ and cycle-free Tanner graphs
  • Sparse factor graph representations of Reed-Solomon and related codes
  • Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes
  • On the capacity of two-dimensional weight-constrained memories
  • On networks of two-way channels
  • A new approach to the design of digital communication systems
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.