Optimal universal coding with respect to the maximal individual relative redundancy criterion

Optimal universal coding with respect to the maximal individual relative redundancy criterion

In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-var...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of IEEE International Symposium on Information Theory p. 420
Main Authors: Shtarkov, Yu.M., Tjalkens, Tj.J., Willems, F.M.J.
Format: Conference Proceeding
Language:English
Published: IEEE 1997
Subjects:
Decoding
Entropy
Hafnium
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.
ISBN:9780780339569
0780339568
DOI:10.1109/ISIT.1997.613357