The Use and Usefulness of Fibonacci Codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.
Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2016
EditorsJan Holub , Jan Zd’arek
PublisherPrague Stringology Club
Number of pages5
ISBN (Print)978-80-01-05996-8
StatePublished - 2016

Bibliographical note

Place of conference:Czech Republic


Dive into the research topics of 'The Use and Usefulness of Fibonacci Codes'. Together they form a unique fingerprint.

Cite this