(Enter summary)
Abstract: We describe a block-sorting, lossless data compression algorithm, and our implementation of that algorithm. We compare the performance of our implementation with widely available data compressors running on the same hardware. The algorithm works by applying a reversible transformation to a block of input text. The transformation does not itself compress the data, but re-orders it to make it easy to compress with simple algorithms such as move-to-front encoding. Our algorithm achieves speed... (Update)
Cited by: More
Data Compression Algorithms for Energy-Constrained Devices.. - Sadler, Martonosi (2006)
(Correct)
TREECHOP: A Tree-based Query-able Compressor for XML - Leighton, Müldner, Diamond (2005)
(Correct)
A Grammar-based Approach for Compressing XML - Leighton, Diamond, Müldner (2005)
(Correct)
Active bibliography (related documents): More All
0.3: Online Data Compression in a Mass Storage File System - Odysseas Pentakalos (1995)
(Correct)
0.3: Evaluating the Effect of Online Data Compression on the.. - Odysseas Pentakalos (1995)
(Correct)
0.2: Block Sorting Text Compression - Final Report - Fenwick (1996)
(Correct)
Similar documents based on text: More All
0.8: Autonet: a High-speed, Self-configuring Local Area .. - Schroeder.. (1991)
(Correct)
0.2: Improvements to Burrows-Wheeler Compression Algorithm - Deorowicz (2000)
(Correct)
0.2: Universal Data Compression Based on the Burrows-Wheeler.. - Balkenhol, Kurtz (2000)
(Correct)
Related documents from co-citation: More All
28: Text compression (context) - Bell, Cleary et al. - 1990
24: A Universal Algorithm for Sequential Data Compression
- Ziv, Lempel
23: A locally adaptive data compression scheme (context) - Bentley, Sleator et al. - 1986
BibTeX entry: (Update)
M. Burrows and D.J. Wheeler. A block-sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, Palo Alto, California, 1994. http://citeseer.ist.psu.edu/76182.html More
@techreport{ burrows94blocksorting,
author = "M. Burrows and D. J. Wheeler",
title = "A block-sorting lossless data compression algorithm.",
number = "124",
year = "1994",
url = "citeseer.ist.psu.edu/76182.html" }
Citations (may not include all citations):
458
A universal algorithm for sequential data compression
- Ziv, Lempel - 1977 DBLP
293
Compression of individual sequences via variable rate coding
- Ziv, Lempel - 1978
228
A technique for high performance data compression (context) - Welch - 1984
172
A space economical suffix tree construction algorithm (context) - McCreight - 1976
112
Suffix arrays: A new method for on-line string searches (context) - Manber, Myers - 1993
35
Modeling for text compression (context) - Bell, Witten et al. - 1989 ACM DBLP
6
Canterbury text compression corpus (context) - Witten, Bell
4
A locally adaptive data compression algorithm (context) - Bentley, Sleator et al. - 1986
3
Anonymous ftp from prep (context) - Gailly, Version
1
Anonymous ftp from wuarchive (context) - Nelson, statistical et al. - 1991
1
Posted to the Internet newsgroup comp (context) - Jannesen, Version - 1992
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC