{"title":"误差弹性LZ'77方案及其分析","authors":"S. Lonardi, W. Szpankowski, Mark Daniel Ward","doi":"10.1109/ISIT.2004.1365095","DOIUrl":null,"url":null,"abstract":"The devastating effect of errors in adaptive data compression is a long-standing open problem. In this paper LZ'77 is changed theoretically and experimentally observed, such that in a significant proportion of LZ'77 phrases, there is more than one copy of the longest prefix in the compressed file. Once the redundant bits of LZ'77 have been identified, it is exploited for channel coding. For error correction and detection RS (255,255-2e) Reed-Solomon codes are used.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Error resilient LZ'77 scheme and its analysis\",\"authors\":\"S. Lonardi, W. Szpankowski, Mark Daniel Ward\",\"doi\":\"10.1109/ISIT.2004.1365095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The devastating effect of errors in adaptive data compression is a long-standing open problem. In this paper LZ'77 is changed theoretically and experimentally observed, such that in a significant proportion of LZ'77 phrases, there is more than one copy of the longest prefix in the compressed file. Once the redundant bits of LZ'77 have been identified, it is exploited for channel coding. For error correction and detection RS (255,255-2e) Reed-Solomon codes are used.\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365095\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The devastating effect of errors in adaptive data compression is a long-standing open problem. In this paper LZ'77 is changed theoretically and experimentally observed, such that in a significant proportion of LZ'77 phrases, there is more than one copy of the longest prefix in the compressed file. Once the redundant bits of LZ'77 have been identified, it is exploited for channel coding. For error correction and detection RS (255,255-2e) Reed-Solomon codes are used.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
