Skip Navigation


The Computer Journal Advance Access first published online on May 14, 2009
This version published online on July 11, 2009
The Computer Journal, doi:10.1093/comjnl/bxp046
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
bxp046v2    most recent
bxp046v1
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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Klein, S. T.
Right arrow Articles by Ben-Nissan, M. K.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

On the Usefulness of Fibonacci Compression Codes

Shmuel T. Klein* and Miri Kopel Ben-Nissan

Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel

* Corresponding author: tomi{at}cs.biu.ac.il

Received 7 June 2008; revised 29 December 2008

Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. This paper shows that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m ≥ 2. Fibonacci codes have been used before, and this paper extends previous work presenting several novel features. In particular, the compression efficiency is analyzed and compared to that of dense codes, and various table-driven decoding routines are suggested.

Key Words: text compression • Fibonacci codes • dense codes

Handling editor: Alberto Apostolico


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




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.