Universal Compression of Memoryless Sources Over Unknown Alphabets

DOI10.1109/TIT.2004.830761zbMath1303.94049OpenAlexW2096798913MaRDI QIDQ3547440

Alon Orlitsky, Narayana P. Santhanam, Junan Zhang

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.2004.830761

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Related Items

A lower-bound for the maximin redundancy in pattern coding, Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation, Unnamed Item, On the occupancy problem for a regime-switching model, Methods for diversity and overlap analysis in T-cell receptor populations, On a connection between information and group lattices, Unnamed Item, Estimating Entropy Rates with Bayesian Confidence Intervals, ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES, A lower bound on compression of unknown alphabets, A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage, On consistent and rate optimal estimation of the missing mass, Functional central limit theorems for occupancies and missing mass process in infinite urn models