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

Compressing the Tree of Canonical Binary AIFV Coding

Citation Author(s):
Qi Cheng, Sian-Jheng Lin, Nenghai Yu
Submitted by:
Qi Cheng
Last updated:
20 February 2023 - 11:10pm
Document Type:
Poster
Document Year:
2023
Event:
Paper Code:
179
Categories:
Keywords:
 

Canonical binary AIFV coding contains two trees $T_0$ and $T_1$. We show the method to compress $T_0$, and the method to compress $T_1$ is with a similar way. We provide a new method to store the number of leaves, master nodes and complete internal nodes in each layer and compactly encode the string of numbers according to the specific property between the nodes.

up
0 users have voted: