most citedPolynomial Time Algorithms for Constructing Optimal Binary AIFV- Codes

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

collaborators
Showing cs.ITShow all

1 paper · 1 filter

cs.IT2020★ 3 cited

Polynomial Time Algorithms for Constructing Optimal Binary AIFV- Codes

Mordecai Golin, Elfarouk Harb

Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these constraints permits constructi…