Block sorting and compression

The block sorting lossless data compression algorithm (BSLDCA) described by Burrows and Wheeler (1994) has received considerable attention. It achieves as good compression rates as context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques. This paper, describes the...

Full description

Saved in:
Bibliographic Details
Published inDCC (Los Alamitos, Calif.) pp. 181 - 190
Main Authors Arnavut, Z., Magliveras, S.S.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 1997
Subjects
Application software
Compressors
Computer science
Data compression
Data engineering
Frequency
Image coding
Laboratories
Remote sensing
Sorting
Online AccessGet full text

Cover

More Information
Summary:The block sorting lossless data compression algorithm (BSLDCA) described by Burrows and Wheeler (1994) has received considerable attention. It achieves as good compression rates as context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques. This paper, describes the lexical permutation sorting algorithm (LPSA), its theoretical basis, and delineates its relationship to the BSLDCA. In particular we describe how the BSLDCA can be reduced to the LPSA and show how the LPSA could give better results than the BSLDCA when transmitting permutations. We also introduce a new technique, inversion frequencies, and show that it does as well as move-to-front (MTF) coding when there is locality of reference in the data.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:9780818677618
0818677619
ISSN:1068-0314
2375-0359
DOI:10.1109/DCC.1997.582009