Redundancy rates for renewal and other processes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 2, 1996, Pages 2065-2072

  Csiszár, Imre ^a,b   Shields, Paul C ^a,c,d  

^a IEEE

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c UNIVERSITY OF TOLEDO   (United States)

^d EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Redundancy; Renewal and regenerative processes; Universal coding

Indexed keywords

EID: 0000239750     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556596     Document Type: Article

References (6)

1. L. D. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-796, 1973.
2. R. E. Krichevsky and V. K. Trofimov, "The performance of universal coding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 199-207, 1981.
3. G. H. Hardy and S. Ramanujan, "Asymptotic formulae in combinatorial analysis," Proc. London Math. Soc., ser. 2, vol. XVII, pp. 75-115, 1918.
4. P. Shields, "Universal redundancy rates do not exist," IEEE Trans. Inform. Theory, vol. 39, pp. 520-524, 1993.
5. P. Shields and B. Weiss, "Universal redundancy rates for B-processes do not exist," IEEE Trans. Inform. Theory, vol. 41, no. 2, pp. 508-512, Mar. 1995.
6. J. Shtarkov, "Coding of discrete sources with unknown statistics," in Topics in Information Theory (Coll. Math. Soc. J. Bolyai, no. 16), I. Csiszár and P. Elias, Eds. Amsterdam, The Netherlands: North Holland, 1977, pp. 559-574.