Kentaro Sumigawa

Coding of binary AIFV code trees

2017

Binary AIFV codes, which can attain better compression rate than Huffman codes, uses two code trees that may have incomplete internal nodes, and source symbols are assigned to some internal nodes in addition to leaves. …