Compression with the tudocomp framework

DOI10.4230/LIPICS.SEA.2017.13zbMATH Open1432.68605arXiv1702.07577MaRDI QIDQ4580160FDOQ4580160

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

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

zbMATH Keywords

algorithm engineeringlossless compressionapplication of string algorithmscompression frameworkcompression library

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)

Cited In (12)

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

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)