Decoding Reed-Solomon Codes Using Euclid's Algorithm

被引：0

作者：

Shankar, Prill ^{[1
]}

机构：

[1] Indian Inst Sci, Dept Comp Sci & Automat, Bangalore 560012, Karnataka, India

来源：

RESONANCE-JOURNAL OF SCIENCE EDUCATION | 2007年 / 12卷 / 04期

关键词：

Error correcting codes; Reed-Solomon codes; decoding algorithms;

D O I：

10.1007/s12045-007-0037-y

中图分类号：

G40 [教育学];

学科分类号：

040101 ; 120403 ;

摘要：

Reed Solomon codes are indeed an elegant illustration of a very practical application of abstract algebra. An interesting discovery was the fact that Euclid's algorithm for finding greatest common divisors of polynomials, could be used for decoding these codes. In this article we explain this connection.

引用

页码：37 / 51

页数：15