Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleGrobner basis view of Welch-Berlekamp algorithm for Reed-Solomon codes
Author(s) S. M. Jennings
TypeArticle in Journal
AbstractGrobner bases of modules have been used to provide a unifying theoretical approach to the various algorithms for solving the key equation Omega (x) identical to S(x) Lambda (x) (mod X2f) in decoding Reed-Solomon codes. The Welch-Berlekamp algorithm solves a different key equation based on rational interpolation. When the solution is viewed as a canonical element in a module M, the algorithm is developed by considering Grobner bases with respect to different term orders.
KeywordsGrobner bases, Welch-Berlekamp algorithm, Reed-Solomon codes, decoding, key equation, rational interpolation, canonical element
URL dx.doi.org/10.1049/ip-com:19952282
LanguageEnglish
JournalIEE Proceedings - Communications
Volume142
Number6
Pages349-351
Year1995
Translation No
Refereed No
Webmaster