Universal Compression of Memoryless Sources Over Unknown Alphabets

DOI10.1109/TIT.2004.830761zbMATH Open1303.94049OpenAlexW2096798913MaRDI QIDQ3547440FDOQ3547440

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

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

Mathematics Subject Classification ID

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

Cited In (21)

• Inequalities and algorithms for universal data compression
• On the occupancy problem for a regime-switching model
• Unconditional bases and bit-level compression
• Universal lossless source coding with the Burrows Wheeler transform
• Bounds from a card trick
• 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
• A lower bound on compression of unknown alphabets
• Functional central limit theorems for occupancies and missing mass process in infinite urn models
• On a connection between information and group lattices
• Entropy of some models of sparse random graphs with vertex-names
• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• Estimating Entropy Rates with Bayesian Confidence Intervals
• Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
• Speaking of Infinity
• Universal Lossless Compression With Unknown Alphabets—The Average Case
• Title not available (Why is that?)
• On consistent and rate optimal estimation of the missing mass
• Methods for diversity and overlap analysis in T-cell receptor populations
• Title not available (Why is that?)
• Entropy of Patterns of i.i.d. Sequences—Part I: General Bounds

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)