| Autor: |
Arnavut, Z., Magliveras, S. S. |
| Předmět: |
|
| Zdroj: |
Computer Journal; 1997, Vol. 40 Issue 5, p292-295, 4p |
| Abstrakt: |
The Block Sorting Lossless Data Compression Algorithm (BWT) described by Burrows and Wheeler has received considerable attention. Its compression rates are simliar to 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 BWT. In particular we describe how BWT can be reduced to LPSA and show how LPSA could give better results than BWT when transmitting permutations. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
