用微分方程法推导出t复杂度和lz复杂度的公式

2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI:10.1109/ISIT.2009.5205702

K. Hamano, Hirosuke Yamamoto

{"title":"用微分方程法推导出t复杂度和lz复杂度的公式","authors":"K. Hamano, Hirosuke Yamamoto","doi":"10.1109/ISIT.2009.5205702","DOIUrl":null,"url":null,"abstract":"It is shown that the T-complexity can be derived from a differential equation which represents how average codeword length increases by the T-augmentation. Furthermore, the proposed differential equation method can be applied to the LZ-complexity in the same way. This new approach is simple, and the obtained expressions coincide with the ones in previous studies.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A differential equation method to derive the formulas of the T-complexity and the LZ-complexity\",\"authors\":\"K. Hamano, Hirosuke Yamamoto\",\"doi\":\"10.1109/ISIT.2009.5205702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that the T-complexity can be derived from a differential equation which represents how average codeword length increases by the T-augmentation. Furthermore, the proposed differential equation method can be applied to the LZ-complexity in the same way. This new approach is simple, and the obtained expressions coincide with the ones in previous studies.\",\"PeriodicalId\":412925,\"journal\":{\"name\":\"2009 IEEE International Symposium on Information Theory\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2009.5205702\",\"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 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

结果表明，t复杂度可以由表示平均码字长度随t增加而增加的微分方程导出。此外，所提出的微分方程方法同样可以用于求解lz复杂度。这种新方法简单，得到的表达式与以往的研究结果一致。

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

查看原文本刊更多论文

A differential equation method to derive the formulas of the T-complexity and the LZ-complexity

It is shown that the T-complexity can be derived from a differential equation which represents how average codeword length increases by the T-augmentation. Furthermore, the proposed differential equation method can be applied to the LZ-complexity in the same way. This new approach is simple, and the obtained expressions coincide with the ones in previous studies.

求助全文

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

来源期刊

2009 IEEE International Symposium on Information Theory

自引率

0.00%

发文量