Compression with the tudocomp framework

DOI10.4230/LIPICS.SEA.2017.13MaRDI QIDQ4580160zbMATH OpenFDO

Authors Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane

Publication date 13 August 2018

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

zbMATH Keywords

algorithm engineeringapplication of string algorithmscompression frameworkcompression librarylossless compression

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)

Recommendations

• Data compression with long repeated strings
• scientific article; zbMATH DE number 1542846
• On compressing and indexing repetitive sequences
• LZ78 compression in low main memory space
• A comparison of index-based Lempel-Ziv LZ77 factorization algorithms

Cited in

(14)

• Grammar index by induced suffix sorting
• c-trie++: a dynamic trie tailored for fast prefix searches
• LZRR: LZ77 parsing with right reference
• The Vcodex Platform for Data Compression
• Variable Compression in ProbLog
• Bidirectional Text Compression in External Memory
• Engineering practical Lempel-Ziv tries
• On undetected redundancy in the Burrows-Wheeler transform
• Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
• LZ based compression benchmark on PE Files
• Torus-Based Compression by Factor 4 and 6
• Compression With Actions
• Computing NP-hard repetitiveness measures via MAX-SAT
• Grammar index by induced suffix sorting

This page was built for publication: Compression with the tudocomp framework

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