Nested linear/Lattice codes for structured multiterminal binning

By Ram Zamir, Shlomo Shamai, Uri Erez. IEEE Transactions on Information Theory, 2002

890 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/2a0470448ac411af3d0168a23fdc8c426fa776be

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Data-Hiding Codes (2005, methodology): “[65] studied lattice QIM schemes in which the traditional quantization function is replaced with a dithered quantization function.”
Fundamentals of Wireless Communication (2005, neutral): “Practical construction of the binning schemes (involving two steps: a vector quantization step and a channel coding step) is still an ongoing effort and the current progress is surveyed by Zamir, Shamai and Erez [152].”
Capacity and lattice strategies for canceling known interference (2005, background): “The results in this section (in their preliminary version [15], ) were the basis for the nested lattice binning schemes which were developed for the dirty-paper channel in [45].”
Secure Multiterminal Source Coding With Side Information at the Eavesdropper (2011, methodology): “, using parity-check [22], lattice [22]–[24], or algebraic trellis [25] codes.”
Gossip Algorithms for Distributed Signal Processing (2010, background): “This prediction x̂ 1;ijðtÞ can more closely approximate the true state xiðtÞ compared to the transmitter x̂ 1;iðtÞ and this, in turn, means that (12) can be replaced by a nested quantizer, such as, for example, the nested lattice quantizers in [82].”
A close-to-capacity dirty paper coding scheme (2004, background): “For a detailed account see [1], [16], [17].”
MIMO Broadcast Channels With Finite-Rate Feedback (2006, background): “Though dirty-paper coding is capacity achieving for the MIMO broadcast channel, the technique requires considerable complexity and practical implementations are still being actively pursued [24]–[26].”
On the capacity of MIMO broadcast channels with partial side information (2005, methodology): “Furthermore, the complexity of our scheme is much less than the proposed schemes to implement dirty paper coding with full CSI using nested lattices or trellis precoding [10], [11].”
A vector-perturbation technique for near-capacity multiantenna multiuser communication-part I: channel inversion and regularization (2005, methodology): “Nested lattices are used in [9] for the interference channel, as well as the general multiuser channel.”
Polar Codes for Channel and Source Coding (2009, background): “As discussed in [57], these problems can be tackled using nested linear codes.”
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying (2008, methodology): “The existence of nested lattices for which G(Λc) ≈ 1/(2πe) andG(Λf ) ≈ 1/(2πe) has been shown in [13], [14].”
Compute-and-Forward: Harnessing Interference Through Structured Codes (2009, background): “More generally, Zamir, Shamai, and Erez demonstrated how to use nested lattice codes for many classical AWGN multiterminal problems in [16].”
Shifting the MIMO Paradigm (2007, methodology): “Examples of the latter are vector perturbation, DPC techniques, and Tomlinson-Harashima precoding (THP) (a number of references are listed below).”
Distributed Video Coding (2005, background): “Zamir and Shamai [39] (see also [40]) proved that under certain circumstances, linear codes and nested lattices may approach the Wyner–Ziv rate-distortion function, in particular if the source data and side information are jointly Gaussian.”
On the achievable throughput of a multiantenna Gaussian broadcast channel (2003, background): “In [41], [42], it is shown that the same result holds for arbitrary interference (arbitrary interference statistics , or even arbitraryinterference sequences , where the transmitter knows the individual sequence but ignores its statistics), provided that the transmitter and the receiver share a comm”