On Finite Memory Universal Data Compression and Classification of Individual Sequences

DOI10.1109/TIT.2008.917666zbMath1328.94044arXivcs/0612019OpenAlexW2054438798MaRDI QIDQ3604520

Jacob Ziv

Publication date: 24 February 2009

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

Full work available at URL: https://arxiv.org/abs/cs/0612019

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Related Items (2)

Textual data compression in computational biology: algorithmic techniques ⋮ Space-efficient representation of truncated suffix trees, with applications to Markov order estimation

This page was built for publication: On Finite Memory Universal Data Compression and Classification of Individual Sequences