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 |
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 DetailsDIMACS - Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 68; 2005; 177 ppMSC: 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).
ReadershipGraduate 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
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
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).
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