{"title":"Compressing the Trees of Canonical Binary AIFV Coding","authors":"Qi Cheng, Sian-Jheng Lin, Nenghai Yu","doi":"10.1109/DCC55655.2023.00050","DOIUrl":null,"url":null,"abstract":"Canonical binary AIFV coding [1] contains two trees T<inf>0</inf> and T<inf>1</inf>. We show the method to compress T<inf>0</inf>, and the method to compress T<inf>1</inf> 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.","PeriodicalId":209029,"journal":{"name":"2023 Data Compression Conference (DCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 Data Compression Conference (DCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC55655.2023.00050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Canonical binary AIFV coding [1] contains two trees T0 and T1. We show the method to compress T0, and the method to compress T1 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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
