Skip Navigation

The Computer Journal 1997 40(5):292-295; doi:10.1093/comjnl/40.5.292
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Arnavut, Z.
Right arrow Articles by Magliveras, S. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Lexical Permutation Sorting Algorithm

Z. Arnavut1 and S. S. Magliveras2

1 Department of Mathematics and Computer Science, State University of New York, College at Fredonia, Fredonia NY 14063, USA, 2 Department of Computer Science and Computer Engineering, University of Nebraska, Lincoln NE 68588, USA, 3 Email: arnavut{at}cs.fredonia.edu

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.

Received April 26, 1996. revised October 8, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 International Journal of High Performance Computing ApplicationsHome page
Z. Arnavut
Lossless and Near-Lossless Compression of Ecg Signals with Block-Sorting Techniques
International Journal of High Performance Computing Applications, February 1, 2007; 21(1): 50 - 58.
[Abstract] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.