Lexical Permutation Sorting Algorithm (1997) [4 citations — 2 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Ziya Arnavut and Spyros S. Magliveras},
title = {Lexical Permutation Sorting Algorithm},
journal = {The Computer Journal},
year = {1997},
volume = {40},
pages = {292--295}
}
Bookmarks
OpenURL
Abstract:
In this paper, we describe the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis, and deligneate its relationship to the Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler [1]. In particular we describe how BSLDCA can be reduced to LPSA and point out its possible applications. 1 Introduction Recently, M. Burrows and D. J. Wheeler [1] introduced a new algorithm, which they call the Block Sorting Lossless Data Compression Algorithm (BSLDCA) for lossless data compression. When applied to text or image data their algorithm is claimed to achieve better compression rates than Gzip, Comp-2 and Ziv-Lempel's LZW algorithm, which is widely known to unix users as, compress. In this paper, we define the Lexical Permutation Sorting Algorithm (LPSA), and show that, BSLDCA is reducible to LPSA. The advantage of going to LPSA is that we now have a clear understanding of its theoretical foundations, and have some optimization choices not avai...
Citations
| 1516 | The Art of Computer Programming – Knuth - 1968 |
| 340 | A block sorting lossless data compression algorithm – Burrows, Wheeler - 1994 |
| 2 | Lossless Compression of Multispectral Images Using Permutations – Arnavut, Narulmalani - 1996 |
