Least squares superposition codes with bernoulli dictionary are still reliable at rates up to capacity

Yoshinari Takeishi, Masanori Kawakita, Junnichi Takeuchi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

For the additive white Gaussian noise channel with average power constraint, sparse superposition codes with least squares decoding are proposed by Barron and Joseph in 2010. The codewords are designed by using a dictionary each entry of which is drawn from a Gaussian distribution. The error probability is shown to be exponentially small for all rates up to the capacity. This paper proves that when each entry of the dictionary is drawn from a Bernoulli distribution, the error probability is also exponentially small for all rates up to the capacity. The proof is via a central limit theorem-type inequality, which we show for this analysis.

Original languageEnglish
Article number6776455
Pages (from-to)2737-2750
Number of pages14
JournalIEEE Transactions on Information Theory
Volume60
Issue number5
DOIs
Publication statusPublished - Jan 1 2014

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this