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

Yoshinari Takeishi; Jun'Ichi Takeuchi

doi:10.1109/ISIT.2016.7541483

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

Yoshinari Takeishi, Jun'Ichi Takeuchi

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

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.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1168-1172
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541483
Publication status	Published - Aug 10 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: Jul 10 2016 → Jul 15 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Other

Other	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	7/10/16 → 7/15/16

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2016.7541483

Cite this

Takeishi, Y., & Takeuchi, JI. (2016). An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1168-1172). Article 7541483 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541483

An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. / Takeishi, Yoshinari ; Takeuchi, Jun'Ichi.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1168-1172 7541483 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Takeishi, Y & Takeuchi, JI 2016, An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541483, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 1168-1172, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541483

Takeishi Y , Takeuchi JI. An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1168-1172. 7541483. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2016.7541483

Takeishi, Yoshinari ; Takeuchi, Jun'Ichi. / An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1168-1172 (IEEE International Symposium on Information Theory - Proceedings).

@inproceedings{df213f127e9b4170a6bf3bd1e43d5555,

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

abstract = "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.",

author = "Yoshinari Takeishi and Jun'Ichi Takeuchi",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541483",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1168--1172",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

address = "United States",

}

TY - GEN

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

AU - Takeishi, Yoshinari

AU - Takeuchi, Jun'Ichi

PY - 2016/8/10

Y1 - 2016/8/10

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ISIT.2016.7541483

DO - 10.1109/ISIT.2016.7541483

M3 - Conference contribution

AN - SCOPUS:84985946949

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1168

EP - 1172

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this