MIT/HP Alliance Colloquium: "Nested
Linear/Lattice Codes for Structured Multiterminal Binning"
Prof. Ram Zamir, Tel Aviv
University, Israel, 4-5pm, 36-428
Network information theory promises high gains over simple
point-to-point communication techniques, at the cost of higher
complexity. However, lack of structured coding schemes limited the
practical application of these concepts so far. One of the basic
elements of a network code is the binning scheme. Wyner and other
researchers proposed various forms of coset codes for efficient
binning, yet these schemes were applicable only for lossless source
(or noiseless channel) network coding. To extend the algebraic
binning approach to lossy source (or noisy channel) network coding,
recent work proposed the idea of nested codes, or more specifically,
nested parity check codes for the binary case and nested lattices
the continuous case. These ideas connect network information theory
with the rich areas of linear codes and lattice codes, and have
potential for practical applications. We review these recent
developments and explore their tight relation to concepts such as
combined shaping and precoding, coding for memories with defects
digital watermarking. We also propose a few novel applications
adhering to a unified approach.
Joint work with Shlomo Shamai and Uri Erez.