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

Yoshinari Takeishi, Masanori Kawakita, Jun'Ichi Takeuchi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

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
Countryトルコ
CityIstanbul
Period7/7/137/12/13

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル