Sebastian Deorowicz  Home/Search
Context Related
| zo.iinf.polsl.gliwice.pl/...deo00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: zo.iinf.polsl.gliwice.pl/~s...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In 1994 Burrows and Wheeler presented a new algorithm for lossless data compression. The compression ratio that can be achieved using their algorithm is comparable with the best known other algorithms, whilst its complexity is relatively small. In this paper we explain the internals of this algorithm and discuss its various modifications that have been presented so far. Then we propose new improvements for its effectiveness. They allow us for obtaining the compression ratio equal to 2.271 bpc... (Update)
Context of citations to this paper: More
...of this algorithm stimulated a lof of research. Many of presented so far modi cations were described and discused recently by Deorowicz [14]. In this paper we describe the Burrows Wheeler compression algorithm (BWCA) Later we x our attention on its second step algorithm (Move...
...of this algorithm stimulated a lof of research. Many of its modifications presented so far are described and discussed in Reference [2]. In the first part of this paper we describe the Burrows Wheeler compression algorithm (BWCA) Later we fix our attention on its...
Cited by: More
Second step algorithms in the Burrows-Wheeler compression.. - Deorowicz (2001) (Correct)
An analysis of second step algorithms in the Burrows-Wheeler.. - Deorowicz (2000) (Correct)
Active bibliography (related documents): More All
0.7: Universal Lossless Source Coding With the Burrows.. - Effros.. (2002) (Correct)
0.6: One attempt of a compression algorithm using the BWT - Balkenhol, Shtarkov (1999) (Correct)
0.5: Modifications of the Burrows and Wheeler Data Compression .. - Balkenhol, Kurtz.. (1999) (Correct)
Similar documents based on text: More All
1.2: Burrows Wheeler - Alternatives to Move to Front - Fenwick, Titchener, Lorenz (2003) (Correct)
0.7: Enhanced Word-Based Block-Sorting Text Compression - Isal, Moffat, Ngai (Correct)
0.7: The Burrows-Wheeler Transform: Theory and Practice - Manzini (1999) (Correct)
Related documents from co-citation: More All
2: Block sorting and compression - Arnavut, Magliveras - 1997
2: Average Case Analyses of List Update Algorihtms (context) - Albers, Mitzenmacher - 1998
2: The Context-Tree Weighting Method: Basic properties - Willems, Shtarkov et al. - 1995
BibTeX entry: (Update)
S. Deorowicz. Improvements to Burrows{Wheeler compression algorithm. Software| Practice and Experience 2000; 30(13):1465-1483. http://www-zo.iif.polsl.gliwice.pl/~sdeor/deo00.ps. http://citeseer.ist.psu.edu/deorowicz00improvement.html More
@article{ deorowicz00improvements,
author = "Sebastian Deorowicz",
title = "Improvements to {Burrows-Wheeler} compression algorithm",
journal = "Soft\-ware\emdash Prac\-tice and Experience",
volume = "30",
number = "13",
pages = "1465--1483",
year = "2000",
url = "citeseer.ist.psu.edu/deorowicz00improvement.html" }
Citations (may not include all citations):368 Text Compression (context) - TC, JG et al. - 1990
143 A block-sorting lossless data compression algorithm - Burrows - 1994
91 The context tree weighting method: basic properties - FMJ, YM et al. - 1995
73 A space-economical sux tree construction algorithm (context) - EM - 1976
72 A locally adaptive data compression scheme (context) - JL, DD et al. - 1986
61 Unbounded length context for PPM - JG, WJ et al. - 1995
49 Fast algorithms for sorting and searching strings - JL - 1997
20 A corpus for the evaluation of lossless compression algorith.. - Arnold, Bell - 1997
16 Block sorting text compression (context) - Fenwick - 1996
15 Reducing the space requirement of sux trees (context) - Kurtz - 1999
15 Semantically motivated improvements for PPM variants - Bunton - 1997
11 Switching between two universal source coding algorithms (context) - PAJ, FMJ - 1998
10 Sux arrays: a new method for on-line string searches (context) - Manber - 1993
9 Technical Report LU-CS-TR (context) - NJ, sux et al. - 1999
9 A fast block-sorting algorithm for lossless data compression - Schindler - 1997
7 Universal data compression based on the Burrows and Wheeler .. - Balkenhol, Kurtz - 1998
5 The switching method: elaborations (context) - PAJ, FMJ - 1998
5 Block sorting and compression - Arnavut - 1997
5 Higher compression from the Burrows-Wheeler Transform by mod.. - Chapin - 1998
4 Modications of the Burrows and Wheeler data compression algo.. (context) - Balkenhol, Kurtz - 1999
4 Average case analysis of list update algorithms (context) - Albers, Mitzenmacher - 1998
3 Universal lossless source coding with the Burrows Wheeler Tr.. (context) - ros - 1999
3 Asymptotic optimality of the block sorting data compression .. (context) - Arimura, Yamamoto - 1998
1 Block sorting text compression | nal report (context) - Fenwick - 1996
1 line construction of sux tress (context) - On- - 1995
1 ACM Transactions on Information Systems (context) - at, Neal et al. - 1998
1 IEEE Transactions on Information Theory (context) - RE, VK et al. - 1981
1 The bred3 program (context) - Wheeler - 1997
Documents on the same site (http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub.htm): More
How to Squeeze a Lexicon - Ciura, Deorowicz (2000) (Correct)
Experimental Study Of Finite Automata Storing Static Lexicons - Ciura, Deorowicz (1999) (Correct)
Second step algorithms in the Burrows-Wheeler compression.. - Deorowicz (2001) (Correct)
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