LZ78 Compression in Low Main Memory Space

DOI10.1007/978-3-319-67428-5_4zbMath1454.68197OpenAlexW2750880295MaRDI QIDQ5150917

Diego Arroyuelo, Rajeev Raman, Rodrigo Cánovas, Gonzalo Navarro

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01951607/file/Canovas-spire-2017.pdf

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (2)

Dynamic Path-decomposed Tries ⋮ Engineering Practical Lempel-Ziv Tries

Cites Work

• Unnamed Item
• Succinct dynamic cardinal trees
• Space-efficient construction of Lempel-Ziv compressed text indexes
• Linked dynamic tries with applications to LZ-compression in sublinear time and space
• Stronger Lempel-Ziv based compressed text indexing
• Lempel Ziv Computation in Small Space (LZ-CISS)
• Linear Probing with 5-wise Independence
• Indexing compressed text
• Squeezing succinct data structures into entropy bounds
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• On the k -Independence Required by Linear Probing and Minwise Independence
• m-Bonsai: A Practical Compact Dynamic Trie

This page was built for publication: LZ78 Compression in Low Main Memory Space