逐步解码复合纠错码

S. Sakata
{"title":"逐步解码复合纠错码","authors":"S. Sakata","doi":"10.1109/ISIT.2001.935947","DOIUrl":null,"url":null,"abstract":"Compound-error-correcting codes are codes designed to correct some mixtures of random and burst errors called compound errors. Their compound-error-correction capabilities are measured with respect to a generalized metric introduced by M. Hamada (1997) and discussed by M. Kurihara (2000) recently. We propose step-by-step decoding method for linear compound-error-correcting codes as a generalization of the known step-by-step decoding of linear random-error-correcting codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Step-by-step decoding of compound-error-correcting codes\",\"authors\":\"S. Sakata\",\"doi\":\"10.1109/ISIT.2001.935947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Compound-error-correcting codes are codes designed to correct some mixtures of random and burst errors called compound errors. Their compound-error-correction capabilities are measured with respect to a generalized metric introduced by M. Hamada (1997) and discussed by M. Kurihara (2000) recently. We propose step-by-step decoding method for linear compound-error-correcting codes as a generalization of the known step-by-step decoding of linear random-error-correcting codes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935947\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

复合纠错码是设计用来纠正称为复合错误的随机和突发错误的混合物的码。它们的复合误差校正能力是根据M. Hamada(1997)引入的广义度量来测量的,最近由M. Kurihara(2000)讨论。作为对已知线性随机纠错码分步译码的推广,我们提出了线性复合纠错码的分步译码方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Step-by-step decoding of compound-error-correcting codes
Compound-error-correcting codes are codes designed to correct some mixtures of random and burst errors called compound errors. Their compound-error-correction capabilities are measured with respect to a generalized metric introduced by M. Hamada (1997) and discussed by M. Kurihara (2000) recently. We propose step-by-step decoding method for linear compound-error-correcting codes as a generalization of the known step-by-step decoding of linear random-error-correcting codes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信