符号对读信道上循环码的错误捕获解码

2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI:10.1587/TRANSFUN.E100.A.2578

M. Morii, M. Hirotomo, Makoto Takita

{"title":"符号对读信道上循环码的错误捕获解码","authors":"M. Morii, M. Hirotomo, Makoto Takita","doi":"10.1587/TRANSFUN.E100.A.2578","DOIUrl":null,"url":null,"abstract":"Symbol-pair read channels output overlapping pairs of symbols in storage applications. Pair distance and pair error are used in the channels. In this paper, we discuss the error-trapping decoding for cyclic codes over symbol-pair read channels. By putting some restrictions on the correctable pair error patterns, we discuss a new error-trapping decoding algorithm over the channels and show a circuitry for implementing the decoding algorithm. In addition, we discuss how to modify the restrictions on the correctable pair error patterns.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"60 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Error-trapping decoding for cyclic codes over symbol-pair read channels\",\"authors\":\"M. Morii, M. Hirotomo, Makoto Takita\",\"doi\":\"10.1587/TRANSFUN.E100.A.2578\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Symbol-pair read channels output overlapping pairs of symbols in storage applications. Pair distance and pair error are used in the channels. In this paper, we discuss the error-trapping decoding for cyclic codes over symbol-pair read channels. By putting some restrictions on the correctable pair error patterns, we discuss a new error-trapping decoding algorithm over the channels and show a circuitry for implementing the decoding algorithm. In addition, we discuss how to modify the restrictions on the correctable pair error patterns.\",\"PeriodicalId\":278189,\"journal\":{\"name\":\"2016 International Symposium on Information Theory and Its Applications (ISITA)\",\"volume\":\"60 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Symposium on Information Theory and Its Applications (ISITA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1587/TRANSFUN.E100.A.2578\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Symposium on Information Theory and Its Applications (ISITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/TRANSFUN.E100.A.2578","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

符号对读取通道在存储应用中输出重叠的符号对。通道中使用了对距离和对误差。本文讨论了符号对读信道上循环码的错误捕获译码。通过对可纠错对错误模式的限制，讨论了一种新的信道错误捕获译码算法，并给出了实现该译码算法的电路。此外，我们还讨论了如何修改可校正对错误模式的限制。

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

查看原文本刊更多论文

Error-trapping decoding for cyclic codes over symbol-pair read channels

Symbol-pair read channels output overlapping pairs of symbols in storage applications. Pair distance and pair error are used in the channels. In this paper, we discuss the error-trapping decoding for cyclic codes over symbol-pair read channels. By putting some restrictions on the correctable pair error patterns, we discuss a new error-trapping decoding algorithm over the channels and show a circuitry for implementing the decoding algorithm. In addition, we discuss how to modify the restrictions on the correctable pair error patterns.

求助全文

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

来源期刊

2016 International Symposium on Information Theory and Its Applications (ISITA)

自引率

0.00%

发文量