Toward a Definitive Compressibility Measure for Repetitive Sequences

DOI10.1109/tit.2022.3224382arXiv1910.02151OpenAlexW3125235775MaRDI QIDQ6153652

Nicola Prezza, Gonzalo Navarro, Tomasz Kociumaka

Publication date: 19 March 2024

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

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

zbMATH Keywords

data compressionrepetitive sequencessubstring complexitystring attractorsLempel-Ziv parse

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Related Items (1)

Near-optimal search time in \(\delta \)-optimal space, and vice versa

This page was built for publication: Toward a Definitive Compressibility Measure for Repetitive Sequences