Author of the publication

Universal redundancy rates for the class of B-processes do not exist.

, and . IEEE Trans. Information Theory, 41 (2): 508-512 (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Simplistic Universal Coding. ., and . IEEE Trans. Information Theory, 44 (2): 778-781 (1998)Channels with almost finite memory., and . IEEE Trans. Information Theory, 25 (4): 440-447 (1979)The Interactions Between Ergodic Theory and Information Theory.. IEEE Trans. Information Theory, 44 (6): 2079-2093 (1998)Cutting and stacking: A method for constructing stationary processes.. IEEE Trans. Information Theory, 37 (6): 1605-1617 (1991)Information Theory and Statistics: A Tutorial., and . Found. Trends Commun. Inf. Theory, (2004)Channel Distances and Representation, and . Information and Control, 55 (1-3): 238-264 (October 1982)Total Complexity and the Inference of Best Programs., and . Mathematical Systems Theory, (1977)The ergodic and entropy theorems revisited.. IEEE Trans. Information Theory, 33 (2): 263-266 (1987)Redundancy rates for renewal and other processes., and . IEEE Trans. Information Theory, 42 (6): 2065-2072 (1996)Fixed-rate universal codes for Markov sources., and . IEEE Trans. Information Theory, 24 (3): 360-367 (1978)