Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity

DOI10.1109/18.481775zbMath0845.94007OpenAlexW2162016992MaRDI QIDQ4879987

Enhui Yang, John Cronan Kieffer

Publication date: 29 July 1996

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

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

zbMATH Keywords

Kolmogorov complexitylossless compressionLempel-Ziv algorithmsequential codes

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Source coding (94A29)

Related Items (3)

Approximation of smallest linear tree grammar ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Approximation of grammar-based compression via recompression

This page was built for publication: Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity