{"title":"快速并行算法解码里德-所罗门码","authors":"D. Dabiri, I. Blake","doi":"10.1109/ISIT.1994.394851","DOIUrl":null,"url":null,"abstract":"New algorithms for decoding Reed-Solomon (RS) codes based on remainder polynomials are given. The algorithms solve the Welch-Berlekamp (1983) equations and have a parallel structure suitable for systolic implementation on a linear array of processors.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast parallel algorithms for decoding Reed-Solomon codes\",\"authors\":\"D. Dabiri, I. Blake\",\"doi\":\"10.1109/ISIT.1994.394851\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New algorithms for decoding Reed-Solomon (RS) codes based on remainder polynomials are given. The algorithms solve the Welch-Berlekamp (1983) equations and have a parallel structure suitable for systolic implementation on a linear array of processors.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"118 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394851\",\"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 of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast parallel algorithms for decoding Reed-Solomon codes
New algorithms for decoding Reed-Solomon (RS) codes based on remainder polynomials are given. The algorithms solve the Welch-Berlekamp (1983) equations and have a parallel structure suitable for systolic implementation on a linear array of processors.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
