Algebraic Coding Theory and Information Theory
American Mathematical Society (Verlag)
978-0-8218-3626-2 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
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.
Fountain codes for lossless data compression by G. Caire, S. Shamai, A. Shokrollahi, and S. Verdu Applications of coding theory to universal lossless source coding performance bounds by G. I. Shamir Expander graphs and codes by K. W. Shum and I. F. Blake Multilevel expander codes by A. Barg and G. Zemor Low density parity check lattices based on construction $D^/prime$ and cycle-free Tanner graphs by M. R. Sadeghi and D. Panario Sparse factor graph representations of Reed-Solomon and related codes by J. S. Yedidia Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes by M. El-Khamy and R. J. McEliece On the capacity of two-dimensional weight-constrained memories by S. Litsyn and A. Shpunt On networks of two-way channels by G. Kramer and S. A. Savari A new approach to the design of digital communication systems by R. G. Cavalcante, H. Lazari, J. d. D. Lima, and R. Palazzo, Jr.
| Erscheint lt. Verlag | 1.8.2005 |
|---|---|
| Reihe/Serie | DIMACS: Series in Discrete Mathematics and Theoretical Computer Science |
| Zusatzinfo | Illustrations |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 552 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| ISBN-10 | 0-8218-3626-9 / 0821836269 |
| ISBN-13 | 978-0-8218-3626-2 / 9780821836262 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
