一种新的最优编码方法

A. Grigoryan, E. Regentova
{"title":"一种新的最优编码方法","authors":"A. Grigoryan, E. Regentova","doi":"10.1109/ITCC.2002.1000419","DOIUrl":null,"url":null,"abstract":"A new technique for optimally encoding a given source, statistical properties of which are described by the first-order model is introduced. The calculation of a minimum length of codewords is based on the consecutive redistribution of the self- information of symbols in accordance with their probabilities at each stage of the encoding. The proposed method performs equally well for an arbitrary order of symbol probabilities. While codewords are generated by a separate combinatorial procedure, the overall computational cost of the proposed method is lower than that for the Huffman code.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new method of optimal coding\",\"authors\":\"A. Grigoryan, E. Regentova\",\"doi\":\"10.1109/ITCC.2002.1000419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new technique for optimally encoding a given source, statistical properties of which are described by the first-order model is introduced. The calculation of a minimum length of codewords is based on the consecutive redistribution of the self- information of symbols in accordance with their probabilities at each stage of the encoding. The proposed method performs equally well for an arbitrary order of symbol probabilities. While codewords are generated by a separate combinatorial procedure, the overall computational cost of the proposed method is lower than that for the Huffman code.\",\"PeriodicalId\":115190,\"journal\":{\"name\":\"Proceedings. International Conference on Information Technology: Coding and Computing\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Conference on Information Technology: Coding and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2002.1000419\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2002.1000419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

介绍了一种用一阶模型描述统计特性的给定源的最优编码技术。最小码字长度的计算是基于在编码的每个阶段按照符号的概率连续重新分配符号的自信息。所提出的方法对于任意顺序的符号概率都有很好的效果。虽然码字是由一个单独的组合过程产生的,但所提出的方法的总体计算成本低于霍夫曼码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new method of optimal coding
A new technique for optimally encoding a given source, statistical properties of which are described by the first-order model is introduced. The calculation of a minimum length of codewords is based on the consecutive redistribution of the self- information of symbols in accordance with their probabilities at each stage of the encoding. The proposed method performs equally well for an arbitrary order of symbol probabilities. While codewords are generated by a separate combinatorial procedure, the overall computational cost of the proposed method is lower than that for the Huffman code.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信