Nested Linear/Lattice Codes for Structured Multiterminal Binning (2002)
| Citations: | 342 - 14 self |
BibTeX
@MISC{Zamir02nestedlinear/lattice,
author = {Ram Zamir and Shlomo Shamai (Shitz) and Uri Erez},
title = {Nested Linear/Lattice Codes for Structured Multiterminal Binning},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 in the continuous case. These ideas connect network information theory with the rich areas of linear codes and lattice codes, and have strong 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, and digital watermarking. We also propose a few novel applications adhering to a unified approach.
Keyphrases
structured multiterminal binning linear lattice code network information theory practical application basic element network coding efficient binning simple point-to-point communication technique rich area novel application lossless source network code linear code recent work unified approach tight relation combined shaping continuous case lattice code recent development various form coset code digital watermarking strong potential binning scheme nested code high gain binary case nested lattice parity-check code
