An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary

Yoshinari Takeishi, Jun'Ichi Takeuchi

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

1 被引用数 (Scopus)

抄録

For the additive white Gaussian noise channel with average power constraint, it is shown that sparse superposition codes, proposed by Barron and Joseph in 2010, achieve the capacity. We study the upper bounds on its block error probability with least squares decoding when a dictionary with which we make codewords is drawn from an unbiased Bernoulli distribution. We improve the upper bounds shown by Takeishi et.al. in 2014 with fairly simplified form.

本文言語英語
ホスト出版物のタイトルProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
出版社Institute of Electrical and Electronics Engineers Inc.
ページ1168-1172
ページ数5
ISBN(電子版)9781509018062
DOI
出版ステータス出版済み - 8 10 2016
イベント2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, スペイン
継続期間: 7 10 20167 15 2016

出版物シリーズ

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

その他

その他2016 IEEE International Symposium on Information Theory, ISIT 2016
Countryスペイン
CityBarcelona
Period7/10/167/15/16

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル