Universal redundancy rates do not exist

DOI10.1109/18.212281zbMath0777.94009OpenAlexW2164760593MaRDI QIDQ4202070

Paul C. Shields

Publication date: 16 September 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.212281

zbMATH Keywords

data compressionuniversal codingredundancy bounds

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (6)

A lower-bound for the maximin redundancy in pattern coding ⋮ Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees ⋮ On bounded redundancy of universal codes ⋮ Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences. ⋮ Minimal rates of entropy convergence for completely ergodic systems ⋮ Excess entropy in natural language: Present state and perspectives

This page was built for publication: Universal redundancy rates do not exist