{"title":"几何分布无限源的任意反均匀霍夫曼码","authors":"D. Tarniceriu, V. Munteanu, G. Zaharia","doi":"10.1109/ISSCS.2013.6651254","DOIUrl":null,"url":null,"abstract":"In this paper we consider the class of generalized anti-uniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution. This distribution leads to infinite anti-uniform sources for some ranges of its parameters. Huffman coding of these sources results in AUH codes. We perform a generalization of binary Huffman encoding, using a, M-letter code alphabet and prove that as a result of this encoding, sources with memory are obtained. For these sources we attach the graph and derive the transition probabilities between states, as well as the state probabilities. The entropy and the average cost for AUH codes are derived.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"M-ary anti-uniform Huffman codes for infinite sources with geometric distribution\",\"authors\":\"D. Tarniceriu, V. Munteanu, G. Zaharia\",\"doi\":\"10.1109/ISSCS.2013.6651254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the class of generalized anti-uniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution. This distribution leads to infinite anti-uniform sources for some ranges of its parameters. Huffman coding of these sources results in AUH codes. We perform a generalization of binary Huffman encoding, using a, M-letter code alphabet and prove that as a result of this encoding, sources with memory are obtained. For these sources we attach the graph and derive the transition probabilities between states, as well as the state probabilities. The entropy and the average cost for AUH codes are derived.\",\"PeriodicalId\":260263,\"journal\":{\"name\":\"International Symposium on Signals, Circuits and Systems ISSCS2013\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Signals, Circuits and Systems ISSCS2013\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSCS.2013.6651254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Signals, Circuits and Systems ISSCS2013","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2013.6651254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
M-ary anti-uniform Huffman codes for infinite sources with geometric distribution
In this paper we consider the class of generalized anti-uniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution. This distribution leads to infinite anti-uniform sources for some ranges of its parameters. Huffman coding of these sources results in AUH codes. We perform a generalization of binary Huffman encoding, using a, M-letter code alphabet and prove that as a result of this encoding, sources with memory are obtained. For these sources we attach the graph and derive the transition probabilities between states, as well as the state probabilities. The entropy and the average cost for AUH codes are derived.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
