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

Yoshinari Takeishi, Masanori Kawakita, Junnichi Takeuchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

For the additive white Gaussian noise channel with average power constraint, sparse superposition codes with least squares decoding were proposed by Barron and Joseph in 2010. The codewords are designed by using a dictionary which is drawn from a Gaussian distribution. The error probability is shown to be exponentially small in code length for all rates up to the capacity. This paper proves that when the dictionary is drawn from a Bernoulli distribution, the error probability is also exponentially small for all rates up to the capacity.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1396-1400
Number of pages5
DOIs
Publication statusPublished - Dec 19 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

Fingerprint

Error Probability
Glossaries
Bernoulli
Superposition
Least Squares
Gaussian distribution
Gaussian White Noise
Decoding
Dictionary
Error probability

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Takeishi, Y., Kawakita, M., & Takeuchi, J. (2013). Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. In 2013 IEEE International Symposium on Information Theory, ISIT 2013 (pp. 1396-1400). [6620456] https://doi.org/10.1109/ISIT.2013.6620456

Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. / Takeishi, Yoshinari; Kawakita, Masanori; Takeuchi, Junnichi.

2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 1396-1400 6620456.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takeishi, Y, Kawakita, M & Takeuchi, J 2013, Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620456, pp. 1396-1400, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620456
Takeishi Y, Kawakita M, Takeuchi J. Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. In 2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 1396-1400. 6620456 https://doi.org/10.1109/ISIT.2013.6620456
Takeishi, Yoshinari ; Kawakita, Masanori ; Takeuchi, Junnichi. / Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. 2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. pp. 1396-1400
@inproceedings{445ffc3ec537440d8a7c99ffad908ab3,
title = "Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity",
abstract = "For the additive white Gaussian noise channel with average power constraint, sparse superposition codes with least squares decoding were proposed by Barron and Joseph in 2010. The codewords are designed by using a dictionary which is drawn from a Gaussian distribution. The error probability is shown to be exponentially small in code length for all rates up to the capacity. This paper proves that when the dictionary is drawn from a Bernoulli distribution, the error probability is also exponentially small for all rates up to the capacity.",
author = "Yoshinari Takeishi and Masanori Kawakita and Junnichi Takeuchi",
year = "2013",
month = "12",
day = "19",
doi = "10.1109/ISIT.2013.6620456",
language = "English",
isbn = "9781479904464",
pages = "1396--1400",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

}

TY - GEN

T1 - Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity

AU - Takeishi, Yoshinari

AU - Kawakita, Masanori

AU - Takeuchi, Junnichi

PY - 2013/12/19

Y1 - 2013/12/19

N2 - For the additive white Gaussian noise channel with average power constraint, sparse superposition codes with least squares decoding were proposed by Barron and Joseph in 2010. The codewords are designed by using a dictionary which is drawn from a Gaussian distribution. The error probability is shown to be exponentially small in code length for all rates up to the capacity. This paper proves that when the dictionary is drawn from a Bernoulli distribution, the error probability is also exponentially small for all rates up to the capacity.

AB - For the additive white Gaussian noise channel with average power constraint, sparse superposition codes with least squares decoding were proposed by Barron and Joseph in 2010. The codewords are designed by using a dictionary which is drawn from a Gaussian distribution. The error probability is shown to be exponentially small in code length for all rates up to the capacity. This paper proves that when the dictionary is drawn from a Bernoulli distribution, the error probability is also exponentially small for all rates up to the capacity.

UR - http://www.scopus.com/inward/record.url?scp=84890327273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890327273&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620456

DO - 10.1109/ISIT.2013.6620456

M3 - Conference contribution

SN - 9781479904464

SP - 1396

EP - 1400

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

ER -