基于整数序列编码方法的新族和新成员

2009 Data Compression Conference Pub Date : 2009-03-16 DOI:10.1109/DCC.2009.87

Daniel Lowell, D. Tamir

{"title":"基于整数序列编码方法的新族和新成员","authors":"Daniel Lowell, D. Tamir","doi":"10.1109/DCC.2009.87","DOIUrl":null,"url":null,"abstract":"This paper presents Integer sequences that have the property of being additively and/or multiplicatively complete, Zekendorf, and unique Zekendorf. In addition, a generalized Elias coding scheme is developed. Features of Zekendorf sequence based and generalized Elias coding compression methods including compression rate, universality, asymptotic optimality, and coding complexity are analyzed.","PeriodicalId":377880,"journal":{"name":"2009 Data Compression Conference","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Families and New Members of Integer Sequence Based Coding Methods\",\"authors\":\"Daniel Lowell, D. Tamir\",\"doi\":\"10.1109/DCC.2009.87\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents Integer sequences that have the property of being additively and/or multiplicatively complete, Zekendorf, and unique Zekendorf. In addition, a generalized Elias coding scheme is developed. Features of Zekendorf sequence based and generalized Elias coding compression methods including compression rate, universality, asymptotic optimality, and coding complexity are analyzed.\",\"PeriodicalId\":377880,\"journal\":{\"name\":\"2009 Data Compression Conference\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2009.87\",\"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 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2009.87","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了具有加性和/或乘性完全、齐肯多夫和唯一齐肯多夫性质的整数序列。此外，还提出了一种广义的Elias编码方案。分析了基于Zekendorf序列和广义Elias编码压缩方法的压缩率、通用性、渐近最优性和编码复杂度等特征。

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

查看原文本刊更多论文

New Families and New Members of Integer Sequence Based Coding Methods

This paper presents Integer sequences that have the property of being additively and/or multiplicatively complete, Zekendorf, and unique Zekendorf. In addition, a generalized Elias coding scheme is developed. Features of Zekendorf sequence based and generalized Elias coding compression methods including compression rate, universality, asymptotic optimality, and coding complexity are analyzed.

求助全文

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

来源期刊

2009 Data Compression Conference

自引率

0.00%

发文量