Universal Compression of Memoryless Sources Over Unknown Alphabets

DOI10.1109/TIT.2004.830761MaRDI QIDQ3547440zbMATH OpenOpenAlexFDO

Authors 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) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Source coding (94A29)

Recommendations

• A lower bound on compression of unknown alphabets
• Universal Lossless Compression With Unknown Alphabets—The Average Case
• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
• Speaking of Infinity
• On the MDL principle for i.i.d. sources with large alphabets

Cited in

(22)

• Inequalities and algorithms for universal data compression
• A lower bound on compression of unknown alphabets
• On consistent and rate optimal estimation of the missing mass
• Functional central limit theorems for occupancies and missing mass process in infinite urn models
• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Methods for diversity and overlap analysis in T-cell receptor populations
• Unconditional bases and bit-level compression
• Estimating Entropy Rates with Bayesian Confidence Intervals
• Speaking of Infinity
• Universal Compression of Markov and Related Sources Over Arbitrary 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
• Universal lossless source coding with the Burrows Wheeler transform
• Consistent estimation of small masses in feature sampling
• scientific article; zbMATH DE number 7625180 (Why is no real title available?)
• On the occupancy problem for a regime-switching model
• Phase transitions for the uniform distribution in the pattern maximum likelihood problem and its Bethe approximation
• Entropy of some models of sparse random graphs with vertex-names
• On a connection between information and group lattices
• Bayesian nonparametric inference for ``species-sampling problems
• A lower-bound for the maximin redundancy in pattern coding

This page was built for publication: Universal Compression of Memoryless Sources Over Unknown Alphabets

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