Notes on Block-Sorting Data Compression

Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

Volumn 82, Issue 6, 1999, Pages 18-25

  Yokoo, Hidetoshi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Burrows Wheeler transform; Data compression; KMR algorithm; Text compression; Universal codes

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; SORTING;

BLOCK-SORTING DATA COMPRESSION; BURROWS-WHEELER TRANSFORM; KARP-MILLER-ROSENBERG (KMR) ALGORITHM; ZIV-LEMPEL CODES;

DATA COMPRESSION;

EID: 0033148446     PISSN: 10420967     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6440(199906)82:6<18::AID-ECJC3>3.0.CO;2-7     Document Type: Article

References (14)

1. Burrows M, Wheeler DJ. A block-sorting lossless data compression algorithm. SRC Research Report 1994; 124.
2. Park JW, Imai H. A study on block-sorting data compression. Technical Report of IEICE 1995; 94:43-48.
3. Ei T, Inabeppu K, Uehara S. Note on data compression with block sorting. Technical Report of IEICE 1996;95:43-48.
4. Nelson M. Data compression with the Burrows-Wheeler Transform. Dr. Dobb's Journal, Sept. 1996, also available at: http://web2.airmail.net/markn/ articles/bwt/bwt.htm.
5. Fenwick PM. Block-sorting text compression - final report. Technical Report 130, Department of Computer Science, University of Auckland, Auckland, New Zealand, 1996. Anonymous ftp: ftp.cs.auckland.ac.nz, File: /out/peter-f/TechRep130.ps.
6. Arnavut Z, Magliveras SS. Block sorting and compression. DCC'97, In Storer JA, Cohn M, editors. Proc. Data Compression Conf. Snowbird. IEEE Computer Society Press; 1997. p 181-190.
7. Yokoo H. Data compression using a sort-based context similarity measure. The Computer Journal 1997;40:94-102.
8. Schindler M. A fast block-sorting algorithm for lossless data compression. In Storer A, Cohn M, editors. DCC'97, Proc. Data Compression Conf. Snowbird. IEEE Computer Society Press; 1997. p. 469. Extended version is available at: http://eiunix. tuwien.ac.at/~michael/papers/dcc97eab.ps.
9. Karp RM, Miller RE, Rosenberg AL. Rapid identification of repeated patterns in strings, trees and arrays. Proc 4th ACM Symposium on Theory of Computing 1972;125-136.
10. Crochemore M, Rytter W. Text Algorithms. New York: Oxford University Press; 1994.
11. Fenwick PM. Symbol ranking text compression. Technical Report 132, Department of Computer Science, University of Auckland, Auckland, New Zealand, 1996. Anonymous ftp: ftp.cs.auckland.ac.nz, File: /out/peter-f/TechRep 132.ps.
12. Bentley JL, Sleator DD, Tarjan RE, Wei VK. A locally adaptive data compression scheme. Comm ACM 1986;29:320-330.
13. Elias P. Interval and recency rank source coding: Two on-line adaptive variable-length schemes. IEEE Trans Inf Theory 1987;IT-33:3-10.
14. Storer JA, Szymanski TG. Data compression via textual substitution. J ACM 1982;29:928-951.