Simple channel coding bounds

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1804-1808

  Wang, Ligong ^a   Colbeck, Roger ^a   Renner, Renato ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY;

INFORMATION THEORY;

CHANNEL CODING;

EID: 70350712175     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205312     Document Type: Conference Paper

References (16)

1. C. E. Shannon, "A mathematical theory of communication," Bell System Techn. J, vol. 27, pp. 379-423 and 623-656, July and Oct. 1948.
2. S. Verdu and 1. S. Han, "A general formula for channel capacity," IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1147-1157, July 1994.
3. Y. Polyanskiy, H. V. Poor, and S. Verdu, "New channel coding achievability bounds," in Proc. IEEE Int. Symposium on Inf. Theory, Toronto, Canada, July 6-11, 2008.
4. A. Renyi, "On measures of entropy and information," in 4th Berkeley Conference on Mathematical Statistics and Probability, University of California, Berkeley, CA, USA, 1961.
5. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. 11, no. 1, pp. 3-19, Jan. 1965.
6. S. Arimoto, "Information measures and capacity of order Q for discrete memoryless channels," in Topics in Information Theory, I. Csiszar and P. Elias, Eds., 1977, pp. 41-52.
7. I. Csiszar, "Generalized cutoff rates and Renyi's information measures," IEEE Trans. Inform. Theory, vol. 41, no. 1, pp. 26-34, Jan. 1995.
8. R. Renner, S. Wolf, and J. Wullschleger, "The single-serving channel capacity," in Proc. IEEE Int. Symposium on Inf. Theory, Seattle, Washington, USA, July 9-14, 2006.
9. R. Renner and S. Wolf, "Smooth Renyi entropy and applications," in Proc. IEEE Int. Symposium on Inf. Theory, Chicago, Illinois, USA, June 27 - July 2, 2004.
10. N. Datta, "Min- and max-relative entropies and a new entanglement monotone," 2008. [Online]. Available: http://arxiv.org/abs/0803.2770
11. L. Wang and R. Renner, "One-shot classical capacity of quantum channels," presented at The Twelfth Workshop on Quantum Inform. Processing (QIP), poster session.
12. T. S. Han and S. Verdu, "Approximation theory of output statistics," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 752-772, 1993.
13. T. S. Han, Information Spectrum Methods in Information Theory. Springer Verlag, 2003.
14. S. Vembu, S. Verdu, and Y. Steinberg, "The source-channel separation theorem revisited," IEEE Trans. Inform. Theory, vol. 41, no. 1, pp. 4454, Jan. 1995.
15. P.-N. Chen and F. Alajaji, "Optimistic Shannon coding theorems for arbitrary single-user systems," IEEE Trans. Inform. Theory, vol. 45, no. 7, pp. 2623-2629, Nov. 1999.
16. Y. Steinberg, "New converses in the theory of identification via channels," IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 984-998, May 1998.