Disjointness of random sequence sets with respect to distinct probability measures

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 756-760

  Han, Te Sun ^a   Hamada, Mitsuru ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Disjointness; Kullback leibler information; Mth order composition (type); Probability measure; Random sequence; Stochastic typicality

Indexed keywords

PROBABILITY; SET THEORY; THEOREM PROVING;

DETERMINISTIC RANDOM SEQUENCES; KULLBACK-LEIBLER INFORMATION;

RANDOM PROCESSES;

EID: 0033100160     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.749026     Document Type: Article

References (8)

1. P. Martin-Löf, "The definition of random sequences," Inform. Contr., vol. 9, pp. 602-619, 1966.
2. T.M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
3. L.D. Davisson, G. Longo, and A. Sgarro, "The error exponent for the noiseless encoding of finite ergodic Markov sources," IEEE Trans. Inform. Theory, vol. IT-27, pp. 43138, July 1981.
4. G. Chaitin, "A theory of program size formally identical to information theory," J. Assoc. Comp. Mach., vol. 22, no. 3, pp. 329-340, July 1975.
5. M. Li and P. Vitânyi, An Introduction to Kolmogorov Complexity and Its Applications. New York: Springer-Verlag, 1993.
6. G. Chaitin, Algorithmic Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 1987.
7. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
8. V.G. Vovk, "On a randomness criterion," Sov. Math.-Dokl., vol. 35, no. 3, pp. 656-660, 1987.