{"title":"用Reed-Solomon码校正单突发错误的新算法","authors":"D. Chi","doi":"10.1109/MILCOM.1991.258469","DOIUrl":null,"url":null,"abstract":"The author presents a fast algorithm which can correct a single burst error length up to n-k-1 for a RS (n,k) code. Several methods which can reduce the probability of misdecoding if the length of the burst is longer than ((n-k)/2) are discussed. An RS (Reed-Solomon) decoder design is proposed which performs a regular error correction and the proposed burst error correction simultaneously. This method can also be used for BCH codes and for RS codes over Galois fields of characteristics other than two.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new algorithm for correcting single burst errors with Reed-Solomon codes\",\"authors\":\"D. Chi\",\"doi\":\"10.1109/MILCOM.1991.258469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author presents a fast algorithm which can correct a single burst error length up to n-k-1 for a RS (n,k) code. Several methods which can reduce the probability of misdecoding if the length of the burst is longer than ((n-k)/2) are discussed. An RS (Reed-Solomon) decoder design is proposed which performs a regular error correction and the proposed burst error correction simultaneously. This method can also be used for BCH codes and for RS codes over Galois fields of characteristics other than two.<<ETX>>\",\"PeriodicalId\":212388,\"journal\":{\"name\":\"MILCOM 91 - Conference record\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 91 - Conference record\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1991.258469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 91 - Conference record","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1991.258469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new algorithm for correcting single burst errors with Reed-Solomon codes
The author presents a fast algorithm which can correct a single burst error length up to n-k-1 for a RS (n,k) code. Several methods which can reduce the probability of misdecoding if the length of the burst is longer than ((n-k)/2) are discussed. An RS (Reed-Solomon) decoder design is proposed which performs a regular error correction and the proposed burst error correction simultaneously. This method can also be used for BCH codes and for RS codes over Galois fields of characteristics other than two.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
