{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
