Lattices which are good for (almost) everything

Authors:
U. Erez;S. Litsyn;R. Zamir
Affiliations:
Dept. of Electr. Eng.-Syst., Tel-Aviv Univ., Israel;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 13

Random coding bound for the second moment of multidimensional lattices

Problems of Information Transmission
Information Theoretic Security

Foundations and Trends in Communications and Information Theory
Hybrid coding for Gaussian broadcast channels with Gaussian sources

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The finite-dimensional Witsenhausen counterexample

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Joint Wyner-Ziv/dirty-paper coding by modulo-lattice modulation

IEEE Transactions on Information Theory
Lattices for distributed source coding: jointly Gaussian sources and reconstruction of a linear function

IEEE Transactions on Information Theory
Lattices for distributed source coding: jointly Gaussian sources and reconstruction of a linear function

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Distributed transmission of functions of correlated sources over a fading multiple access channel

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Distributed joint source-channel coding for functions over a multiple access channel

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Capacity of the Gaussian two-way relay channel to within 1/2 bit

IEEE Transactions on Information Theory
Joint physical layer coding and network coding for bidirectional relaying

IEEE Transactions on Information Theory
Joint power allocation for multicast systems with physical-layer network coding

EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Witsenhausen's counterexample and its links with multimedia security problems

IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking

Quantified Score

Hi-index	755.08

Visualization

Abstract

We define an ensemble of lattices, and show that for asymptotically high dimension most of its members are simultaneously good as sphere packings, sphere coverings, additive white Gaussian noise (AWGN) channel codes and mean-squared error (MSE) quantization codes. These lattices are generated by applying Construction A to a random linear code over a prime field of growing size, i.e., by "lifting" the code to Rn.