基于子串枚举的无损数据压缩改进

2011 10th IEEE/ACIS International Conference on Computer and Information Science Pub Date : 2011-05-16 DOI:10.1109/ICIS.2011.41

K. Iwata, M. Arimura, Yuki Shima

{"title":"基于子串枚举的无损数据压缩改进","authors":"K. Iwata, M. Arimura, Yuki Shima","doi":"10.1109/ICIS.2011.41","DOIUrl":null,"url":null,"abstract":"Dube ´ and Beaudoin proposed a new technique of loss less data compression called compression via sub string enumeration (CSE) in 2010. It has been indicated that the compression ratio of CSE achieves competitive performance for ones of the best PPM variants and BZIP2 from the viewpoint of experimental results. We refine the technique of CSE to reduce the candidate value of range to encode, and make the compression performance of our improvement clear analytically for some input strings, which have zero entropy rate. We show that the performance of compression ratio of the improved CSE never becomes worse than one of the original CSE for any source string in linear-time and linear-space complexity for the length of string.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An Improvement in Lossless Data Compression via Substring Enumeration\",\"authors\":\"K. Iwata, M. Arimura, Yuki Shima\",\"doi\":\"10.1109/ICIS.2011.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dube ´ and Beaudoin proposed a new technique of loss less data compression called compression via sub string enumeration (CSE) in 2010. It has been indicated that the compression ratio of CSE achieves competitive performance for ones of the best PPM variants and BZIP2 from the viewpoint of experimental results. We refine the technique of CSE to reduce the candidate value of range to encode, and make the compression performance of our improvement clear analytically for some input strings, which have zero entropy rate. We show that the performance of compression ratio of the improved CSE never becomes worse than one of the original CSE for any source string in linear-time and linear-space complexity for the length of string.\",\"PeriodicalId\":256762,\"journal\":{\"name\":\"2011 10th IEEE/ACIS International Conference on Computer and Information Science\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 10th IEEE/ACIS International Conference on Computer and Information Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2011.41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2011.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

Dube和Beaudoin在2010年提出了一种新的无损数据压缩技术，称为通过子串枚举(CSE)压缩。从实验结果来看，CSE的压缩比与最佳PPM变体之一和BZIP2具有竞争性能。我们对CSE技术进行了改进，减少了需要编码的范围的候选值，并对一些熵率为零的输入字符串的压缩性能进行了分析。结果表明，对于任意源字符串，改进CSE的压缩比性能在字符串长度的线性时间和线性空间复杂度上都不会比原始CSE差。

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

查看原文本刊更多论文

An Improvement in Lossless Data Compression via Substring Enumeration

Dube ´ and Beaudoin proposed a new technique of loss less data compression called compression via sub string enumeration (CSE) in 2010. It has been indicated that the compression ratio of CSE achieves competitive performance for ones of the best PPM variants and BZIP2 from the viewpoint of experimental results. We refine the technique of CSE to reduce the candidate value of range to encode, and make the compression performance of our improvement clear analytically for some input strings, which have zero entropy rate. We show that the performance of compression ratio of the improved CSE never becomes worse than one of the original CSE for any source string in linear-time and linear-space complexity for the length of string.

求助全文

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

来源期刊

2011 10th IEEE/ACIS International Conference on Computer and Information Science

自引率

0.00%

发文量