A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes
[article]
2017
arXiv
pre-print
Preserved Fulltext
Other Versions
We show that the worst-case redundancy of the extended binary AIFV codes is 1/m for m ≤ 4. ...
Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. ...
WORST-CASE REDUNDANCY OF OPTIMAL BINARY AIFV CODES AND THEIR EXTENDED CODES In this section, we first show the worst-case redundancy of optimal binary AIFV codes [5] , which directly suggests superiority ...
arXiv:1607.07247v4
fatcat:pqj634o2hbcetdvssnl6ugwlqq
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
AIFV-2 codes are a new method for constructing lossless codes for memoryless sources that provide better worst-case redundancy than Huffman codes. ...
They do this by using two code trees instead of one and also allowing some bounded delay in the decoding process. ...
The procedure for constructing optimal (min-redundancy) AIFV-2 codes is much more complicated than that of finding Huffman codes. ...
arXiv:2002.09885v1
fatcat:veq3kygd4jg5zccfd7fctwpwfu