Arimoto channel coding converse and Rényi divergence

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1327-1333

  Polyanskiy, Yury ^a   Verdú, Sergio ^a  

^a Princeton University   (United States)

Author keywords

Feedback; Information measures; R nyi divergence; Shannon theory; Strong converse

Indexed keywords

DISCRETE MEMORYLESS CHANNELS; DIVERGENCE MEASURES; INFORMATION MEASURES; SHANNON THEORY; SPHERE PACKINGS; STRONG CONVERSE; UPPER BOUND;

DATA HANDLING; SPHERES;

CODES (SYMBOLS);

EID: 79952387980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5707067     Document Type: Conference Paper

References (18)

1. S. Arimoto, "On the converse to the coding theorem for discrete memoryless channels," IEEE Trans. Inf. Theory, vol. 19, no. 3, pp. 357-359, May 1973.
2. S. Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147-1157, 1994.
3. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inf. Theory, vol. 11, no. 1, pp. 3-18, 1965.
4. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
5. Y. Polyanskiy, H. V. Poor, and S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
6. R. Sibson, "Information radius," Z. Wahrscheinlichkeitstheorie und Verw. Geb., vol. 14, pp. 149-161, 1969.
7. I. Csiszár, "Generalized cutoff rates and Renyi's information measures," IEEE Trans. Inf. Theory, vol. 41, no. 1, pp. 26-34, Jan. 1995.
8. A. Y. Sheverdyaev, "Lower bound for error probability in a discrete memoryless channel with feedback," Prob. Peredachi Inform., vol. 18, no. 4, pp. 5-15, 1982.
9. G. Como and B. Nakiboǧlu, "Sphere-packing bound for block-codes with feedback and finite memory," in Proc. 2010 IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX, USA, Jun. 2010.
10. H. Palaiyanur and A. Sahai, "An upper bound for the block coding error exponent with delayed feedback," in Proc. 2010 IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX, USA, Jun. 2010.
11. A. Rényi, "On measures of entropy and information," in Proc. 4th Berkeley Symp. Mathematics, Statistics, and Probability, vol. 1, Berkeley, CA, USA, 1961, pp. 547-561.
12. I. Csiszár, "Information-type measures of difference of probability distributions and indirect observation," Studia Sci. Math. Hungar., vol. 2, pp. 229-318, 1967.
13. F. Liese and I. Vajda, "On divergences and informations in statistics and information theory," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4394-4412, 2006.
14. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding on discrete memoryless channels i," Inf. Contr., vol. 10, pp. 65-103, 1967.
15. S. Arimoto, "Computation of random coding exponent functions," IEEE Trans. Inf. Theory, vol. 22, no. 6, pp. 665-671, Nov. 1976.
16. -, "Information measures and capacity of order α for discrete memoryless channels," in Topics in Information Theory, ser. Colloq. Math. Soc. J. Bolyai 16, I. Csiszár and P. Elias, Eds. Amsterdam: North Holland, 1977, pp. 41-52.
17. I. Csiszár, "Axiomatic characterizations of information measures," Entropy, vol. 10, no. 3, pp. 261-73, 2008.
18. C. E. Shannon, "The zero error capacity of a noisy channel," IRE Trans. Inform. Theory, vol. 2, no. 3, pp. 8-19, Sep. 1956.