In these papers associated with the workshop of December 2003, contributors describe their work in fountain codes for lossless data compression, an application of coding theory to universal lossless source coding performance bounds, expander graphs and codes, multilevel expander codes, low parity check lattices, sparse factor graph representations of Reed-Solomon and related codes. Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes, the capacity of two-dimensional weight-constrained memories, networks of two-way channels, and a new approach to the design of digital communication systems. Annotation ©2005 Book News, Inc., Portland, OR (booknews.com)
