On identification capacity of infinite alphabets or continuous-time channels

IEEE Transactions on Information Theory

Volumn 46, Issue 7, 2000, Pages 2407-2414

  Burnashev, Marat V ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; INTEGRAL EQUATIONS; PHOTONS; PROBABILITY; SIGNAL ENCODING; THEOREM PROVING; WHITE NOISE;

CONTINUOUS TIME CHANNEL; DISCRETE TIME CHANNEL; INFINITE ALPHABETS; POISSON CHANNEL;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0034318250     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.887853     Document Type: Article

References (17)

1. R. Ahlswede and G. Dueck, Identification via channels, IEEE Trans. Inform. Theory, vol. 35, pp. 15-29, Jan. 1989.
2. L. A. Bassalygo and M. V. Burnashev, Estimate for the maximal number of messages for a given probability of succesful deception, Probl. Inform. Transm., vol. 30, no. 2, pp. 4218, 1994.
3. Authentication, identification and pairwise separated measures, Probl. Inform. Transm., vol. 32, no. 1, pp. 41-17, 1996.
4. M. V. Burnashev, Minimax detection of inaccurately known signal in the background of white Gaussian noise, Theory ofProbab. Its Applic., vol. 24, no. 1, pp. 106-118, 1979.
5. On method of types and approximation of output measures for channels with infinite alphabets, Probt. Inform. Transm., submitted for publication.
6. M. V. Burnashev, Diskrete Strukturen in der Mathematik, Germany: Bielefeld Univ., 1996. Preprint 96-011, Sonderforschungsbereich 343, Selected Topics of Information Theory and Mathematical Statistics.
7. M. V. Burnashev and I. A. Begmatov, On a signal detection problem leading to stable distributions, Theory of Probab. Its Applic., vol. 35, no. 3, pp. 1169-1172, 1990.
8. M. V. Burnashev and S. Verdü, Measures separated in L, metrics and ID-codes, Probl. Inform. Transm., vol. 30, no. 3, pp. 3-14, 1994.
9. M. V. Burnashev and Y. A. Kutoyants, On sphere-packing bound, capacity and related results for Poisson channel, Probl. Inform. Transm., vol. 35, no. 2, pp. 3-22, 1999.
10. T. M. Cover and J. A. Tomas, Information Theory. New York: Wiley, 1991.
11. M. H. A. Davis, Capacity and cutoff rate for Poisson-type channels, IEEE Trans. Inform. Theory, vol. IT-26, pp. 710-715, Nov. 1980.
12. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
13. T. S. Han, Information-Spectrum Methods in Information Theory. Tokyo, Japan: Baifukan, 1998. (In Japanese).
14. T. S. Han and S. Verdü, New results in the theory of identification via channels, IEEE Trans. Inform. Theory, vol. 38, pp. 14-25, Jan. 1992.
15. Approximation theory of output statistics, IEEE Trans. Inform. Theory, vol. 39, pp. 752-772, July 1993.
16. Y M. Kabanov, The capacity of a channel of the Poisson type, Theory ofProbab. Its Applic., vol. 23, no. 1, pp. 143-147, 1978.
17. A. D. Wyner, Capacity and error exponent for the direct detection photon channel-Part I, IEEE Trans. Inform. Theory, vol. 34, pp. 1449-1461, Nov. 1988.