TY - GEN
T1 - Using Fibonacci compression codes as alternatives to dense codes
AU - Klein, Shmuel T.
AU - Ben-Nissan, Miri Kopel
PY - 2008
Y1 - 2008
N2 - 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, they compress better and are more robust, at the price of being slower.
AB - 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, they compress better and are more robust, at the price of being slower.
UR - http://www.scopus.com/inward/record.url?scp=50249173447&partnerID=8YFLogxK
U2 - 10.1109/dcc.2008.54
DO - 10.1109/dcc.2008.54
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:50249173447
SN - 0769531210
SN - 9780769531212
T3 - Data Compression Conference Proceedings
SP - 472
EP - 481
BT - Proceedings - 2008 Data Compression Conference, DCC 2008
T2 - 2008 Data Compression Conference, DCC 2008
Y2 - 25 March 2008 through 27 March 2008
ER -