On fast Fourier transform-based decoding of Reed-Solomon codes
by Yunghsiang S. Han; Chao Chen; Sian-Jheng Lin; Baoming Bai
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 36, No. 3, 2021

Abstract: Reed-Solomon (RS) codes is a popular class of codes that have been implemented in many practical systems. Recently, a fast approach to the error decoding of RS codes based on fast Fourier transform (FFT) was invented. In this work, we derive the key equation based on the Lagrange polynomial and then present erasure-and-error decoding of an (n; k) RS code. This decoding algorithm can simultaneously correct up to v errors and f erasures when 2v + f < n − k + 1. The decoding complexity is with only O(n log n + (n − k) log²(n − k)).

Online publication date: Wed, 31-Mar-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com