Sorry, you need to enable JavaScript to visit this website.

Non-Binary Robust Universal Variable Length Codes

Citation Author(s):
Dana Shapira
Shmuel T.\ Klein, Tamar C.\ Serebro, Dana Shapira
Submitted by:
Dana Shapira
Last updated:
23 March 2020 - 10:58am
Document Type:
Poster
Event:
DCC 2020
Categories:
Emerging: Big Data
Keywords:
Coding
 

We extend the binary Fibonacci code to $d$-ary codes, with $d\ge 2$.
This is motivated by future technological developments in which the basic unit of storage will not be just a 2-valued bit, but possibly an element that is able to distinguish between $d$ different values.
The proposed codes are prefix-free, complete and more robust than Huffman codes. Experimental results illustrate that the compression efficiency of non-binary Fibonacci codes are very close to the savings achieved by the corresponding non-binary Huffman coding of the same order.

up
0 users have voted:

Comments

Submitted by Dominik Koeppl on 18 April 2020 - 7:06am

While reading your poster, I've collected some small questions:

First, $F_i$ is the $i$-th Fibonacci word (it is not explicitly defined)?

Under properties, what does 'robustness' mean in this context?

About the two evaluation diagrams at the bottom:
- what are the 'chars'? The number of bytes needed to encode the respective word?
- is the length the binary representation or the character length (depending on the alphabet)?
- what kind of data sets were used? (length, entropy, alphabet size, etc.)
- with Huffman, you mean that you build the Huffman tree up to length m?

CITE

QUESTIONS?