most citedPolynomial Time Algorithms for Constructing Optimal Binary AIFV- Codes

3 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2020

Speeding up the AIFV- dynamic programs by two orders of magnitude using Range Minimum Queries

Mordecai Golin, Elfarouk Harb

AIFV- 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…