Converse coding theorems for identification via channels

IEEE Transactions on Information Theory

Volumn 59, Issue 2, 2013, Pages 744-759

  Oohama, Yasutada ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Exponent function; general noisy channels; identification via channels; information spectrum method; strong converse theorem

Indexed keywords

BLOCK LENGTHS; CODING THEOREMS; ERROR PROBABILITIES; EXPONENT FUNCTION; INFORMATION SPECTRUM; LOWER BOUNDS; NOISY CHANNEL; STOCHASTIC PROPERTIES; STRONG CONVERSE;

INFORMATION THEORY;

COMPUTER APPLICATIONS;

EID: 84872567639     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2219158     Document Type: Article

References (14)

1. R. Ahlswede and G. Dueck, "Identification via channels," IEEE Trans. Inf. Theory, vol. 35, no. 1, pp. 15-29, Jan. 1989.
2. T. S. Han and S. Verdú, "New results in the theory of identification via channels," IEEE Trans. Inf. Theory, vol. 38, no. 1, pp. 14-25, Jan. 1992.
3. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
4. Y. Steinberg, "New converses in the theory of identification via channels," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 984-998, May 1998. (Pubitemid 128743261)
5. Y. Oohama, "Error probability of identification via channels at rates above capacity," in Proc. IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, Jun. 2002, p. 26. (Pubitemid 34964648)
6. Y. Oohama, "Average error probability of identification via channels at rates above identification capacity," in Proc. Int. Symp. Inf. Theory Appl., Xi'an, China, Oct. 2002, pp. 859-862.
7. M. Hayashi, "General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and its application to wire-tap channel," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, Apr. 2006.
8. T. S. Han, Information-Spectrum Methods in Information Theory. Berlin, Germany: Springer-Verlag, 2002.
9. S. Arimoto, "On the converse to the coding theorem for discrete memoryless channels," IEEE Trans. Inf. Theory, vol. IT-19, no. 3, pp. 357-359, May 1973.
10. G. Dueck and J. Körner, "Reliability function of a discrete memoryless channel at rates above capacity," IEEE Trans. Inf. Theory, vol. IT-25, no. 1, pp. 82-85, Jan. 1979. (Pubitemid 9413546)
11. R. G. Gallager, Information Theory and Reliable Communication. New York: Willey, 1968.
12. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
13. Y. Oohama, On two strong converse theorems for stationary discrete memoryless channels [Online]. Available: http ://arxiv.org/abs/1008. 1140
14. I. Csiszár, "Generalized cutoff rates and Rényi's information measures," IEEE Trans. Inf. Theory, vol. 41, no. 1, pp. 26-34, Jan. 1995.