Title :
Tighter bounds on universal noiseless coding for finite sequences
Author_Institution :
Dept. of Math., Osaka Univ., Japan
fDate :
27 Jun-1 Jul 1994
Abstract :
The paper presents two tighter bounds on the minimax (maxmin) redundancy in universal noiseless coding in comparison with Davisson et al.´s (1981) work for finite sequences. One is the lower bound when the sources have any estimator achieving the Cramer-Rao bound (Theorem 1); whereas the other is the upper bound with in the O(1/n) terms from the asymptotically optimal minimax redundancy derived by Clarke and Barren for independent sources (Theorem 2)
Keywords :
minimax techniques; redundancy; sequences; source coding; Cramer-Rao bound; asymptotically optimal minimax redundancy; finite sequences; independent source; lower bound; maxmin redundancy; universal noiseless coding; upper bound; Covariance matrix; Cramer-Rao bounds; Entropy; Mathematics; Minimax techniques; Upper bound;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394631
