DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 2005; 177 pp; hardcover Volume: 68 ISBN10: 0821836269 ISBN13: 9780821836262 List Price: US$87 Member Price: US$69.60 Order Code: DIMACS/68
 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. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and research mathematicians interested in coding and information theory. Table of Contents  G. Caire, S. Shamai, A. Shokrollahi, and S. Verdú  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. Zémor  Multilevel expander codes
 M. R. Sadeghi and D. Panario  Low density parity check lattices based on construction \(D^\prime\) and cyclefree Tanner graphs
 J. S. Yedidia  Sparse factor graph representations of ReedSolomon and related codes
 M. ElKhamy and R. J. McEliece  Interpolation multiplicity assignment algorithms for algebraic softdecision decoding of ReedSolomon codes
 S. Litsyn and A. Shpunt  On the capacity of twodimensional weightconstrained memories
 G. Kramer and S. A. Savari  On networks of twoway channels
 R. G. Cavalcante, H. Lazari, J. d. D. Lima, and R. Palazzo, Jr.  A new approach to the design of digital communication systems
