A lower-bound for the maximin redundancy in pattern coding
From MaRDI portal
Publication:845432
DOI10.3390/e11040634zbMath1179.94053OpenAlexW2022249568MaRDI QIDQ845432
Publication date: 29 January 2010
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e11040634
Cites Work
- A Mathematical Theory of Communication
- A lower bound on compression of unknown alphabets
- Speaking of Infinity
- Universal Compression of Memoryless Sources Over Unknown Alphabets
- On the MDL principle for i.i.d. sources with large alphabets
- Universal Lossless Compression With Unknown Alphabets—The Average Case
- Universal coding, information, prediction, and estimation
- A unified approach to weak universal source coding
- Universal redundancy rates do not exist
- Redundancy rates for renewal and other processes
- A general minimax result for relative entropy
- Universal noiseless coding
- AN ASYMPTOTIC FORMULA IN THE THEORY OF PARTITIONS