Comparison of LZ77-type parsings
- 25 September 2018
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 141, 25-29
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Approximation of grammar-based compression via recompressionTheoretical Computer Science, 2015
- On compressing and indexing repetitive sequencesTheoretical Computer Science, 2013
- On the Bit-Complexity of Lempel--Ziv CompressionSIAM Journal on Computing, 2013
- The Smallest Grammar ProblemIEEE Transactions on Information Theory, 2005
- Indexing text using the Ziv–Lempel trieJournal of Discrete Algorithms, 2004
- Application of Lempel–Ziv factorization to the approximation of grammar-based compressionTheoretical Computer Science, 2003
- Data compression via textual substitutionJournal of the ACM, 1982
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- Affine m-ary gray codesInformation and Control, 1963