{"title":"D-ary霍夫曼码的码字长度和平均码字长度的严格界限。第1部分","authors":"G. Zaharia, V. Munteanu, D. Tarniceriu","doi":"10.1109/ISSCS.2009.5206161","DOIUrl":null,"url":null,"abstract":"This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundancy.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 1\",\"authors\":\"G. Zaharia, V. Munteanu, D. Tarniceriu\",\"doi\":\"10.1109/ISSCS.2009.5206161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundancy.\",\"PeriodicalId\":277587,\"journal\":{\"name\":\"2009 International Symposium on Signals, Circuits and Systems\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"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.5206161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Symposium on Signals, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2009.5206161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 1
This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundancy.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
