Compression with the tudocomp Framework

@inproceedings{Dinklage2017CompressionWT,
  title={Compression with the tudocomp Framework},
  author={P. Dinklage and J. Fischer and D. K{\"o}ppl and Marvin L{\"o}bel and K. Sadakane},
  booktitle={SEA},
  year={2017}
}
We present a framework facilitating the implementation and comparison of text compression algorithms. We evaluate its features by a case study on two novel compression algorithms based on the Lempel-Ziv compression schemes that perform well on highly repetitive texts. 
Bidirectional Text Compression in External Memory
On Undetected Redundancy in the Burrows-Wheeler Transform
  • U. Baier
  • Computer Science, Mathematics
  • CPM
  • 2018
LZRR: LZ77 Parsing with Right Reference
On the Approximation Ratio of Lempel-Ziv Parsing
On the Approximation Ratio of Greedy Parsings
Grammar Index By Induced Suffix Sorting
Separate Chaining Meets Compact Hashing
Separate Chaining Meets Compact Hashing
  • D. Köppl
  • Mathematics, Computer Science
  • ArXiv
  • 2019
...
1
2
...

References

SHOWING 1-10 OF 37 REFERENCES
Brotli Compressed Data Format
A universal algorithm for sequential data compression
Lossless Data Compression Testbed: ExCom and Prague Corpus
Design of Practical Succinct Data Structures for Large Data Collections
Managing Gigabytes: Compressing and Indexing Documents and Images
On the Bit-Complexity of Lempel-Ziv Compression
Lempel-Ziv Computation in Compressed Space (LZ-CICS)
Bicriteria Data Compression: Efficient and Usable
Offline dictionary-based compression
...
1
2
3
4
...