霍夫曼等效码中的自同步字符串

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323818

Lei Cao

{"title":"霍夫曼等效码中的自同步字符串","authors":"Lei Cao","doi":"10.1109/ITW2.2006.323818","DOIUrl":null,"url":null,"abstract":"Possession of self-synchronization strings (SSSs) is a favorable feature of Huffman equivalent codes. In this paper, first, we show that SSSs in a Huffman equivalent code are in fact codewords or concatenation of codewords and then give a method to find those short SSSs without exhaustive search. Second, we present a closed-form solution to show how often the SSSs can be encountered in a coded sequence","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"192 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Self-Synchronization Strings in Huffman Equivalent Codes\",\"authors\":\"Lei Cao\",\"doi\":\"10.1109/ITW2.2006.323818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Possession of self-synchronization strings (SSSs) is a favorable feature of Huffman equivalent codes. In this paper, first, we show that SSSs in a Huffman equivalent code are in fact codewords or concatenation of codewords and then give a method to find those short SSSs without exhaustive search. Second, we present a closed-form solution to show how often the SSSs can be encountered in a coded sequence\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"192 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

拥有自同步字符串(SSSs)是霍夫曼等效码的一个有利特征。本文首先证明了霍夫曼等效码中的SSSs实际上是码字或码字的串接，然后给出了一种无需穷举搜索即可找到这些短SSSs的方法。其次，我们提出了一个封闭形式的解决方案，以显示在编码序列中遇到SSSs的频率

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

查看原文本刊更多论文

Self-Synchronization Strings in Huffman Equivalent Codes

Possession of self-synchronization strings (SSSs) is a favorable feature of Huffman equivalent codes. In this paper, first, we show that SSSs in a Huffman equivalent code are in fact codewords or concatenation of codewords and then give a method to find those short SSSs without exhaustive search. Second, we present a closed-form solution to show how often the SSSs can be encountered in a coded sequence

求助全文

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

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量