A Decoding Approach to Reed–Solomon Codes from Their Definition
From MaRDI portal
Publication:4577009
DOI10.1080/00029890.2018.1420333zbMATH Open1396.94115arXiv1706.03504OpenAlexW2963870842WikidataQ58118432 ScholiaQ58118432MaRDI QIDQ4577009FDOQ4577009
Authors: Maria Bras-Amorós 
Publication date: 11 July 2018
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Abstract: Because of their importance in applications and their quite simple definition, Reed-Solomon codes can be explained in any introductory course on coding theory. However, decoding algorithms for Reed-Solomon codes are far from being simple and it is difficult to fit them in introductory courses for undergraduates. We introduce a new decoding approach, in a self-contained presentation, which we think may be appropriate for introducing error correction of Reed-Solomon codes to nonexperts. In particular, we interpret Reed-Solomon codes by means of the degree of the interpolation polynomial of the code words and from this derive a decoding algorithm. Compared to the classical algorithms, our algorithm appears to arise more naturally from definitions and to be easier to understand. It is related to the Peterson-Gorenstein-Zierler algorithm.
Full work available at URL: https://arxiv.org/abs/1706.03504
Recommendations
- The decoding of extended Reed-Solomon codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Decoding of Reed Solomon codes beyond the error-correction bound
- A New Algorithm for Decoding Reed-Solomon Codes
- Decoding Reed–Solomon Skew-Differential Codes
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
- Two new decoding algorithms for Reed-Solomon codes
- On Reed-Solomon codes
- scientific article; zbMATH DE number 1461545
- scientific article; zbMATH DE number 1026591
Cites Work
- A Mathematical Theory of Communication
- On decoding by error location and dependent sets of error positions
- Algebraic coding theory
- Polynomial Codes Over Certain Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Class of Error-Correcting Codes in $p^m $ Symbols
- Shift-register synthesis and BCH decoding
- Introduction to Coding Theory
- On the existence of error-correcting pairs
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
- Simple algorithms for decoding systematic Reed-Solomon codes
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- A method for solving key equation for decoding goppa codes
- Bit-serial Reed - Solomon encoders
- A course in error-correcting codes.
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts
- Bounded distance+1 soft-decision Reed-Solomon decoding
- On the equivalence of the Berlekamp-Massey and the Euclidean algorithms for decoding
Cited In (14)
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials
- Power Decoding of Reed–Solomon Codes Revisited
- A New Algorithm for Decoding Reed-Solomon Codes
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
- An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)
- A Universal Reed-Solomon Decoder
- Reed-Solomon codes
- The decoding of extended Reed-Solomon codes
- A new Reed-Solomon code decoding algorithm based on Newton's interpolation
- Two new decoding algorithms for Reed-Solomon codes
This page was built for publication: A Decoding Approach to Reed–Solomon Codes from Their Definition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577009)
