Toward fast reliable communication at rates near capacity with Gaussian noise

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 315-319

  Barron, Andrew R ^a   Joseph, Antony ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE GAUSSIAN NOISE CHANNELS; CODE-WORDS; CODEWORD; DECODING ALGORITHM; ERROR PROBABILITIES; GAUSSIAN NOISE; LINEAR COMBINATIONS; POWER CONSTRAINTS; RELIABLE COMMUNICATION; SHANNON CAPACITY; SUCCESSIVE DECODING;

INFORMATION THEORY; PROBABILITY;

DECODING;

EID: 77955680713     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513330     Document Type: Conference Paper

References (31)

1. E. Arikan, "Channel polarization," IEEE Trans. Inform. Theory, v.55, 2009.
2. E. Arikan and E. Telatar, "On the rate of channel polarization," Preprint. ArXiv, Jul.2008.
3. A.R. Barron, "Universal approximation bounds for superpositions of a sigmoidal function," IEEE Trans. Inform. Theory, v.39, 930-944, 1993.
4. A. Barron, A. Cohen, W. Dahmen and R. Devore, "Approximation and learning by greedy algorithms." Ann. Statist. v.36, 64-94, 2007.
5. A.R. Barron, A. Joseph, "Least squares superposition coding of moderate dictionary size, reliable at rates up to channel capacity," Proc. Internat. Symp. Inform. Theory, Austin, Texas, June 2010.
6. A.R. Barron, A. Joseph, "Fast Reliable Communication at Rates not Far from Capacity with Gaussian Noise," Dept. Stat., Yale Univ.
7. 1 minimization," Annals of Statistics, 2009.
8. J. Cao and E.M. Yeh, "Asymptotically optimal multiple-access cummincation via distributed rate splitting," IEEE Trans. Inform. Theory, v.53, 304-319, Jan.2007.
9. T.M. Cover, "Broadcast channels," IEEE Trans. Inform. Theory, v.18, 2-14, 1972.
10. T.M. Cover and JA. Thomas, Elements of Information Theory, New York, Wiley-Interscience, 2006.
11. D.L. Donoho, M. Elad, and V.M. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inform. Theory, v.52, 6-18, Jan. 2006.
12. A.K. Fletcher, S. Rangan, and V.K. Goyal, "Necessary and sufficient conditions for sparsity pattern recovery," IEEE Trans. Inform. Theory, v.55, 5758-5773, 2009.
13. G.D. Forney, Jr. Concatenated Codes, Research Monograph No.37, Cambridge, Massachusetts, M.I.T. Press. 1966.
14. G.D. Forney and G. Ungerboeck, "Modulation and coding for linear Gaussian channels," IEEE Trans. Inform. Theory, v.44, Oct.1998.
15. R.G. Gallager, Low Density Parity-Check Codes, Cambridge, Massachusetts, M.I.T. Press. 1963.
16. R.G. Gallager, Information Theory and Reliable Communication, New York, John Wiley and Sons, 1968.
17. C. Huang, A.R. Barron, and G.H.L. Cheang, Preprint, 2008.
18. L. Jones, "A simple lemma for optimization in a Hilbert space, with application to projection pursuit and neural net training," Annals of Statistics, v.20, 608-613, 1992.
19. A. Karbasi, A. Hormati, S. Mohajer, and M. Vetterli, "Support recovery in compressed sensiing: an estimation theoretic approach. IEEE Internat. Symp. Inform. Theory, 679-683, Seoul Korea, June 2009.
20. W.S. Lee, P. Bartlett, B. Williamson, IEEE Trans. Inform. Theory, 42, 2118-2132, 1996.
21. M.G. Luby, M. Mitzenmacher, MA. Shokrollahi, and DA. Spielman, "Efficient erasure correcting codes." IEEE Trans. Inform. Theory, v.47, 569-584, Feb.2001.
22. M.G. Luby, M. Mitzenmacher, MA. Shokrollahi, and DA. Spielman, "Improved Low-Density Parity-Check Codes Using Irregular Graphs." IEEE Trans. Inform. Theory, v.47, 585-598, Feb. 2001.
23. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam and New York, North-Holland Publishing Co.
24. Y. Polyanskiy, H.V. Poor, and S. Verdú, "Channel coding rate in the finite blocklength regime." IEEE Trans. Inform. Theory. 2010.
25. K.R. Rad, "Sharp upper bound on error probability of exact sparsity recovery," Proc. Conference Inform. Sciences Systems, 2009.
26. IS. Reed and G. Solomon, "Polynomial codes over certain finite fields." J. SIAM, v.8, 300-304, June 1960.
27. B. Rimoldi and R. Urbanke, "A rate-splitting approach to the Gaussian multiple-access channel capacity." IEEE Trans. Inform. Theory, v.47, 364-375, Mar. 2001.
28. CE. Shannon, "A mathematical theory of communication." Bell Syst. Tech. J., v.27, 379-423 and 623-656, 1948.
29. J. Tropp, "Just relax: convex programming methods for identifying sparse signals in noise," IEEE Trans. Inform. Theory, v.52, 1030-1051, Mar. 2006.
30. 1-constrained quadratic programming (Lasso)." IEEE Trans. Inform. Theory, v.55, 2183-2202, May 2009.
31. M.J. Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Inform. Theory, v.55, 5728-5741, Dec. 2009.