变长不等代价解析与整形编码

IEEE Trans. Inf. Theory Pub Date : 1997-06-29 DOI:10.1109/18.681344

J. Abrahams

{"title":"变长不等代价解析与整形编码","authors":"J. Abrahams","doi":"10.1109/18.681344","DOIUrl":null,"url":null,"abstract":"Shaping codes can be obtained from optimal unequal cost coding algorithms due to Lempel, Even, and Cohn (1973) in the variable-length-to-block case and to Varn (1971) in the block-to-variable-length case. The former is related to ad hoc approaches to shaping previously described while the latter is novel in the shaping context.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"14 1","pages":"1648-1650"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Variable-Length Unequal Cost Parsing and Coding for Shaping\",\"authors\":\"J. Abrahams\",\"doi\":\"10.1109/18.681344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Shaping codes can be obtained from optimal unequal cost coding algorithms due to Lempel, Even, and Cohn (1973) in the variable-length-to-block case and to Varn (1971) in the block-to-variable-length case. The former is related to ad hoc approaches to shaping previously described while the latter is novel in the shaping context.\",\"PeriodicalId\":13250,\"journal\":{\"name\":\"IEEE Trans. Inf. Theory\",\"volume\":\"14 1\",\"pages\":\"1648-1650\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Trans. Inf. Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/18.681344\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Inf. Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/18.681344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

整形码可以从可变长度到块的情况下的Lempel, Even和Cohn(1973)和块到可变长度情况下的Varn(1971)的最优不等代价编码算法中获得。前者与前面描述的整形的特殊方法有关，而后者在整形上下文中是新颖的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Variable-Length Unequal Cost Parsing and Coding for Shaping

Shaping codes can be obtained from optimal unequal cost coding algorithms due to Lempel, Even, and Cohn (1973) in the variable-length-to-block case and to Varn (1971) in the block-to-variable-length case. The former is related to ad hoc approaches to shaping previously described while the latter is novel in the shaping context.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Trans. Inf. Theory

自引率

0.00%

发文量