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

Yoshinari Takeishi, Masanori Kawakita, Jun'Ichi Takeuchi

研究成果: 著書/レポートタイプへの貢献会議での発言

3 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトル2013 IEEE International Symposium on Information Theory, ISIT 2013
ページ1396-1400
ページ数5
DOI
出版物ステータス出版済み - 12 19 2013
イベント2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, トルコ
継続期間: 7 7 20137 12 2013

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
ISSN(印刷物)2157-8095

その他

その他2013 IEEE International Symposium on Information Theory, ISIT 2013
トルコ
Istanbul
期間7/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

これを引用

Takeishi, Y., Kawakita, M., & Takeuchi, JI. (2013). Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. : 2013 IEEE International Symposium on Information Theory, ISIT 2013 (pp. 1396-1400). [6620456] (IEEE International Symposium on Information Theory - Proceedings). 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, Jun'Ichi.

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Takeishi, Y, Kawakita, M & Takeuchi, JI 2013, Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. : 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620456, IEEE International Symposium on Information Theory - Proceedings, pp. 1396-1400, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, トルコ, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620456
Takeishi Y, Kawakita M, Takeuchi JI. 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. p. 1396-1400. 6620456. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620456
Takeishi, Yoshinari ; Kawakita, Masanori ; Takeuchi, Jun'Ichi. / 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 (IEEE International Symposium on Information Theory - Proceedings).
@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 Jun'Ichi Takeuchi",
year = "2013",
month = "12",
day = "19",
doi = "10.1109/ISIT.2013.6620456",
language = "English",
isbn = "9781479904464",
series = "IEEE International Symposium on Information Theory - Proceedings",
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, Jun'Ichi

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

AN - SCOPUS:84890327273

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1396

EP - 1400

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

ER -