Optimality of linear codes over PAM for the modulo-additive Gaussian channel

Ayal Hitron, Uri Erez

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

It has long been known that linear codes achieve the capacity of additive channels over finite fields. Much less has been known about the performance of linear codes over ℤ M, when used for communication over channels that are additive with respect to this group. Further, linear codes over ℤ M play an important role in construction of lattices in Euclidean space. When a construction-A lattice is used for communication over an additive white Gaussian noise channel, a modulo-Mℤ additive channel with unimodal noise is induced at the receiver. In this paper it is shown that linear codes over ℤ M achieve the capacity of such channels when the cardinality of the alphabet is a power of a prime.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages1742-1746
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period1/07/126/07/12

Fingerprint

Dive into the research topics of 'Optimality of linear codes over PAM for the modulo-additive Gaussian channel'. Together they form a unique fingerprint.

Cite this