A strong version of the redundancy-capacity theorem of universal coding
- 1 May 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (3), 714-722
- https://doi.org/10.1109/18.382017
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Jeffreys' prior is asymptotically least favorable under entropy riskJournal of Statistical Planning and Inference, 1994
- On the minimum description length principle for sources with piecewise constant parametersIEEE Transactions on Information Theory, 1993
- Complexity of strings in the class of Markov sourcesIEEE Transactions on Information Theory, 1986
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- Robust noiseless source coding through a game theoretical approachIEEE Transactions on Information Theory, 1983
- Minimax noiseless universal coding for Markov sourcesIEEE Transactions on Information Theory, 1983
- On total boundedness for existence of weakly minimax universal codes (Corresp.)IEEE Transactions on Information Theory, 1981
- A source matching approach to finding minimax codesIEEE Transactions on Information Theory, 1980
- $I$-Divergence Geometry of Probability Distributions and Minimization ProblemsThe Annals of Probability, 1975
- Universal noiseless codingIEEE Transactions on Information Theory, 1973