Performance of LZ algorithms on individual sequences

DOI10.1109/18.761286MaRDI QIDQ4701386zbMATH OpenOpenAlexFDO

Authors Paul Shields

Publication date 21 November 1999

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

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

zbMATH Keywords

data compressionLempel-Ziv algorithmLempel-Ziv codessource coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• Lempel-Ziv Dimension for Lempel-Ziv Compression
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• Improved redundancy of a version of the Lempel-Ziv algorithm

Cited in

(8)

• On encoding and decoding with two-way head machines
• Lempel-Ziv-like parsing in small space
• Fast gapped variants for Lempel-Ziv-Welch compression
• Space-Conscious Compression
• scientific article; zbMATH DE number 1542846 (Why is no real title available?)
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• Lempel-Ziv Dimension for Lempel-Ziv Compression
• A normal sequence compressed by PPM* but not by Lempel-Ziv 78

This page was built for publication: Performance of LZ algorithms on individual sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701386)