{"title":"代数译码中Berlekamp-Massey算法与欧几里得算法的等价性","authors":"Todd D. Mateer","doi":"10.1109/CWIT.2011.5872142","DOIUrl":null,"url":null,"abstract":"Dornstetter, Heydtmann, and Jensen have previously demonstrated that the Extended Euclidean algorithm and the Berlekamp-Massey algorithm are two equivalent methods used for solving the so-called Key Equation in BCH and Reed-Solomon decoding. This paper presents a new algorithm which makes this correspondence more explicit and is an improvement over each of the two algorithms.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"On the equivalence of the Berlekamp-Massey and the euclidean algorithms for algebraic decoding\",\"authors\":\"Todd D. Mateer\",\"doi\":\"10.1109/CWIT.2011.5872142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dornstetter, Heydtmann, and Jensen have previously demonstrated that the Extended Euclidean algorithm and the Berlekamp-Massey algorithm are two equivalent methods used for solving the so-called Key Equation in BCH and Reed-Solomon decoding. This paper presents a new algorithm which makes this correspondence more explicit and is an improvement over each of the two algorithms.\",\"PeriodicalId\":250626,\"journal\":{\"name\":\"2011 12th Canadian Workshop on Information Theory\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 12th Canadian Workshop on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2011.5872142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2011.5872142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the equivalence of the Berlekamp-Massey and the euclidean algorithms for algebraic decoding
Dornstetter, Heydtmann, and Jensen have previously demonstrated that the Extended Euclidean algorithm and the Berlekamp-Massey algorithm are two equivalent methods used for solving the so-called Key Equation in BCH and Reed-Solomon decoding. This paper presents a new algorithm which makes this correspondence more explicit and is an improvement over each of the two algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
