Universal Compression of Markov and Related Sources Over Arbitrary Alphabets

DOI10.1109/TIT.2006.880013MaRDI QIDQ3547922zbMATH OpenOpenAlexFDO

Authors Anand K. Dhulipala, Alon Orlitsky

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

hidden Markov models (HMMs)integer partitionslarge alphabetsmultidimensional partitionspatternsredundancyuniversal compression

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on compression of unknown alphabets
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Universal Lossless Compression With Unknown Alphabets—The Average Case
• Speaking of Infinity
• Minimax noiseless universal coding for Markov sources

Cited in

(13)

• A lower bound on compression of unknown alphabets
• Universal coding algorithm for a family of context Markov sources
• Probability Distance Based Compression of Hidden Markov Models
• Asymptotic Redundancy of the MTF Scheme for Stationary Ergodic Sources
• Speaking of Infinity
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Universal Lossless Compression With Unknown Alphabets—The Average Case
• Entropy of Patterns of i.i.d. Sequences—Part I: General Bounds
• Bounds from a card trick
• Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
• On the role of pattern matching in information theory
• Algorithmic polarization for hidden Markov models
• scientific article; zbMATH DE number 6460053 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547922)