Universal Compression of Markov and Related Sources Over Arbitrary Alphabets

DOI10.1109/TIT.2006.880013zbMath1320.94047OpenAlexW2154064234MaRDI QIDQ3547922

Alon Orlitsky, Anand K. Dhulipala

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.880013

zbMATH Keywords

redundancyinteger partitionspatternsuniversal compressionhidden Markov models (HMMs)large alphabetsmultidimensional partitions

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Source coding (94A29)

Related Items (1)

Unnamed Item

This page was built for publication: Universal Compression of Markov and Related Sources Over Arbitrary Alphabets