Lempel-Ziv Compression in a Sliding Window

DOI10.4230/LIPICS.CPM.2017.15MaRDI QIDQ5110879zbMATH OpenOpenAlexFDO

Authors Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz

Publication date 25 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.CPM.2017.15

zbMATH Keywords

Lempel-Ziv parsingrightmost matchingsliding window

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• Data compression using an ``imaginary sliding window
• On the bit-complexity of Lempel-Ziv compression
• On the bit-complexity of Lempel-Ziv compression
• On sliding-window universal data compression with limited memory
• Lempel-Ziv Dimension for Lempel-Ziv Compression
• Fast gapped variants for Lempel-Ziv-Welch compression
• scientific article; zbMATH DE number 975330
• Relative Lempel-Ziv Compression of Suffix Arrays
• Lempel-Ziv data compression on parallel and distributed systems

Cited in

(10)

• Data compression using an ``imaginary sliding window
• Lempel-Ziv-like parsing in small space
• LZRR: LZ77 parsing with right reference
• Relations between greedy and bit-optimal LZ77 encodings
• Range predecessor and Lempel-Ziv parsing
• scientific article; zbMATH DE number 1421006 (Why is no real title available?)
• Sublinear time Lempel-Ziv (LZ77) factorization
• New advances in rightmost Lempel-Ziv
• Tight bounds for compressing substring samples
• Maintaining the size of LZ77 on semi-dynamic strings

This page was built for publication: Lempel-Ziv Compression in a Sliding Window

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