A universal prediction lemma and applications to universal data compression and prediction

DOI10.1109/18.923732zbMath0998.94520OpenAlexW2098582547WikidataQ124852959 ScholiaQ124852959MaRDI QIDQ4544585

Jacob Ziv

Publication date: 4 August 2002

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

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

zbMATH Keywords

universal predictiontraining datauniversal data compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Related Items (2)

Using a VOM model for reconstructing potential coding regions in EST sequences ⋮ Measuring the efficiency of the intraday Forex market with a universal data compression algorithm

This page was built for publication: A universal prediction lemma and applications to universal data compression and prediction