Longest‐match string searching for ziv‐lempel compression
- 1 July 1993
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 23 (7) , 757-771
- https://doi.org/10.1002/spe.4380230705
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Data compression with finite windowsCommunications of the ACM, 1989
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Better OPM/L Text CompressionIEEE Transactions on Communications, 1986
- Data compression via textual substitutionJournal of the ACM, 1982
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A fast string searching algorithmCommunications of the ACM, 1977
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- PATRICIA—Practical Algorithm To Retrieve Information Coded in AlphanumericJournal of the ACM, 1968