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
Y1 - 2013
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
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -