Decoding Reed-Solomon codes using Euclid’s algorithm |
| |
| Authors: | Priti Shankar |
| |
| Institution: | (1) Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560 012, India |
| |
| Abstract: | 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.
Priti Shankar is with the Department of Computer Science and Automation at the Indian Institute of Science, Bangalore. Her
interests are in theoretical computer science and error correcting codes. |
| |
| Keywords: | Error correcting codes Reed-Solomon codes decoding algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
|
