Skip Navigation

The Computer Journal 2004 47(1):46-57; doi:10.1093/comjnl/47.1.46
© 2004 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 Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Inversion Coding

Ziya Arnavut

Department of Mathematics and Computer Science, SUNY Fredonia, Fredonia, NY 14063, USA

The Burrows–Wheeler Compression (BWC) described by Burrows and Wheeler has received considerable attention. An essential part of BWC schemes is the Move-to-Front coder (recency ranking). In this paper we introduce a different coding (ranking) scheme, the inversion coder. We prove the information theoretic relationship between interval ranks and canonical sorting permutations. We also introduce a faster and more memory efficient-algorithm for inversion ranks. Finally, we explore the relationship between inversion ranks and recency ranks and show that inversion coding is superior to interval ranking as well as recency ranking.

Received 16 September 2002. Revised 5 June 2003.

* Email: arnavut{at}cs.fredonia.edu


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.