Lattices are everywhere
Author:
- 1 February 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 392-421
Abstract
As bees and crystals (and people selling oranges in the market) know it for many years, lattices provide efficient structures for packing, covering, quantization and channel coding. In the recent years, interesting links were found between lattices and coding schemes for multi-terminal networks. This tutorial paper covers close to 20 years of my research in the area; of enjoying the beauty of lattice codes, and discovering their power in dithered quantization, dirty paper coding, Wyner-Ziv DPCM, modulo-lattice modulation, distributed interference cancelation, and more.Keywords
This publication has 52 references indexed in Scilit:
- The case for structured random codes in network capacity theoremsEuropean Transactions on Telecommunications, 2008
- Lattices Which Are Good for (Almost) EverythingIEEE Transactions on Information Theory, 2005
- On joint source-channel coding for the Wyner-Ziv source and the gel'fand~pinsker channelIEEE Transactions on Information Theory, 2003
- TCM/SSMA communication systems with cascaded sequences and PAM/QAM signal setsIEEE Transactions on Communications, 1998
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997
- The redundancy of source coding with a fidelity criterion. 1. Known statisticsIEEE Transactions on Information Theory, 1997
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- The rate-distortion function for source coding with side information at the decoderIEEE Transactions on Information Theory, 1976
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- On source coding with side information at the decoderIEEE Transactions on Information Theory, 1975