具有单调码字长度的码

[Proceedings] DCC `93: Data Compression Conference Pub Date : 1993-03-30 DOI:10.1109/DCC.1993.253145

J. Abrahams

{"title":"具有单调码字长度的码","authors":"J. Abrahams","doi":"10.1109/DCC.1993.253145","DOIUrl":null,"url":null,"abstract":"The author studies minimum average codeword length coding under the constraint that the codewords are monotonically non-decreasing in length. She derives bounds on the average length of an optimal 'monotonic' code, and gives sufficient conditions such that algorithms for optimal alphabetic codes can be used to find the optimal 'monotonic' code.<<ETX>>","PeriodicalId":315077,"journal":{"name":"[Proceedings] DCC `93: Data Compression Conference","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Codes with monotonic codeword lengths\",\"authors\":\"J. Abrahams\",\"doi\":\"10.1109/DCC.1993.253145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author studies minimum average codeword length coding under the constraint that the codewords are monotonically non-decreasing in length. She derives bounds on the average length of an optimal 'monotonic' code, and gives sufficient conditions such that algorithms for optimal alphabetic codes can be used to find the optimal 'monotonic' code.<<ETX>>\",\"PeriodicalId\":315077,\"journal\":{\"name\":\"[Proceedings] DCC `93: Data Compression Conference\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] DCC `93: Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1993.253145\",\"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] DCC `93: Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1993.253145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在码字长度单调不减小的约束下，研究了最小平均码字长度编码。她导出了最优“单调”码的平均长度的界，并给出了最优字母码的算法可以用来找到最优“单调”码的充分条件

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

查看原文本刊更多论文

Codes with monotonic codeword lengths

The author studies minimum average codeword length coding under the constraint that the codewords are monotonically non-decreasing in length. She derives bounds on the average length of an optimal 'monotonic' code, and gives sufficient conditions such that algorithms for optimal alphabetic codes can be used to find the optimal 'monotonic' code.<>

求助全文

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

来源期刊

[Proceedings] DCC `93: Data Compression Conference

自引率

0.00%

发文量