Buch, Englisch, 176 Seiten, Gewicht: 624 g
Reihe: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
Buch, Englisch, 176 Seiten, Gewicht: 624 g
Reihe: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
ISBN: 978-0-8218-3626-2
Verlag: American Mathematical Society
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.
Contents
- G. Caire, S. Shamai, A. Shokrollahi, and S. Verdu: Fountain codes for lossless data compression
- G. I. Shamir: Applications of coding theory to universal lossless source coding performance bounds
- K. W. Shum and I. F. Blake: Expander graphs and codes
- A. Barg and G. Zemor: Multilevel expander codes
- M. R. Sadeghi and D. Panario: Low density parity check lattices based on construction $Dprime$ and cycle-free Tanner graphs
- J. S. Yedidia: Sparse factor graph representations of Reed-Solomon and related codes
- M. El-Khamy and R. J. McEliece: Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes
- S. Litsyn and A. Shpunt: On the capacity of two-dimensional weight-constrained memories
- G. Kramer and S. A. Savari: On networks of two-way channels
- R. G. Cavalcante, H. Lazari, J. d. D. Lima, and R. Palazzo, Jr.: A new approach to the design of digital communication systems
- G. Caire, S. Shamai, A. Shokrollahi, and S. Verdu: Fountain codes for lossless data compression
- G. I. Shamir: Applications of coding theory to universal lossless source coding performance bounds
- K. W. Shum and I. F. Blake: Expander graphs and codes
- A. Barg and G. Zemor: Multilevel expander codes
- M. R. Sadeghi and D. Panario: Low density parity check lattices based on construction $Dprime$ and cycle-free Tanner graphs
- J. S. Yedidia: Sparse factor graph representations of Reed-Solomon and related codes
- M. El-Khamy and R. J. McEliece: Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes
- S. Litsyn and A. Shpunt: On the capacity of two-dimensional weight-constrained memories
- G. Kramer and S. A. Savari: On networks of two-way channels
- R. G. Cavalcante, H. Lazari, J. d. D. Lima, and R. Palazzo, Jr.: A new approach to the design of digital communication systems
Zielgruppe
Graduate students and research mathematicians interested in coding and information theory.
