Using Fibonacci Compression Codes as Alternatives to Dense Codes

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...

Full description

Saved in:
Bibliographic Details
Published inData Compression Conference (dcc 2008) pp. 472 - 481
Main Authors Klein, S.T., Ben-Nissan, M.K.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2008
Subjects
Application software
compressed search
Computer science
Context
Data compression
Decoding
dense codes
fast decoding
Fibonacci codes
Frequency synchronization
Gallium nitride
Huffman coding
Robustness
Spatial databases
Online AccessGet full text

Cover

More Information
Summary: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 ges 2. Fibonacci codes have been used before, and this paper extends previous work presenting several novel features. In particular, they compress better and are more robust, at the price of being slower.
ISBN:9780769531212
0769531210
ISSN:1068-0314
2375-0359
DOI:10.1109/DCC.2008.54