Word-based text compression using the Burrows–Wheeler transform
- 30 September 2005
- journal article
- Published by Elsevier BV in Information Processing & Management
- Vol. 41 (5), 1175-1192
- https://doi.org/10.1016/j.ipm.2004.08.009
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Second step algorithms in the Burrows–Wheeler compression algorithmSoftware: Practice and Experience, 2001
- Improvements to Burrows-Wheeler compression algorithmSoftware: Practice and Experience, 2000
- Fast and flexible word searching on compressed textACM Transactions on Information Systems, 2000
- Arithmetic coding revisitedACM Transactions on Information Systems, 1998
- Unbounded Length Contexts for PPMThe Computer Journal, 1997
- The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and ImprovementsThe Computer Journal, 1996
- Overview of the Second Text Retrieval Conference (TREC-2)Information Processing & Management, 1995
- Is Huffman coding dead?Computing, 1993
- Word‐based text compressionSoftware: Practice and Experience, 1989
- A locally adaptive data compression schemeCommunications of the ACM, 1986