A Decoding Approach to Reed–Solomon Codes from Their Definition
From MaRDI portal
Publication:4577009
DOI10.1080/00029890.2018.1420333zbMath1396.94115arXiv1706.03504OpenAlexW2963870842WikidataQ58118432 ScholiaQ58118432MaRDI QIDQ4577009
Publication date: 11 July 2018
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.03504
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Simple algorithms for decoding systematic Reed-Solomon codes
- On decoding by error location and dependent sets of error positions
- Decoding of Reed Solomon codes beyond the error-correction bound
- A course in error-correcting codes.
- On the existence of error-correcting pairs
- On the equivalence of the Berlekamp-Massey and the Euclidean algorithms for decoding
- Polynomial Codes Over Certain Finite Fields
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Bit-serial Reed - Solomon encoders
- A method for solving key equation for decoding goppa codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Bounded distance+1 soft-decision Reed-Solomon decoding
- A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts
- A Class of Error-Correcting Codes in $p^m $ Symbols
- Shift-register synthesis and BCH decoding
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Introduction to Coding Theory
