{"title":"Information quantities attached to M-ary antiuniform Huffman codes","authors":"V. Munteanu, D. Tarniceriu, G. Zaharia","doi":"10.1109/ISSCS.2009.5206164","DOIUrl":null,"url":null,"abstract":"In this paper M-ary antiuniform Huffman codes are considered. In this case the source probability distribution assures the minimum average codeword length, by diversifying only one node on each level in the tree graph. A matrix characterization of the M-ary antiuniform Huffman code as a source with memory is performed and the information quantities are derived.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"177 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Symposium on Signals, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2009.5206164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper M-ary antiuniform Huffman codes are considered. In this case the source probability distribution assures the minimum average codeword length, by diversifying only one node on each level in the tree graph. A matrix characterization of the M-ary antiuniform Huffman code as a source with memory is performed and the information quantities are derived.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
