On Reed-Solomon codes
From MaRDI portal
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. This two-part paper addresses this problem. In the first part, the author improves known upper bounds for the error distance of a received word to a Reed-Solomon code over \(\text{GF}(q)\). These are useful in determining if efficient list-decoding algorithms can be applied. In the second part, the author proves estimates, and even explicit formulas, for the dimension of trace Reed-Solomon codes in some cases.
Recommendations
- Reed-Solomon codes
- scientific article; zbMATH DE number 1026591
- On the Reed-Muller codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- On Expanded Cyclic and Reed–Solomon Codes
- scientific article; zbMATH DE number 3695083
- Reed-Muller Codes
- On a conjecture on Reed-Muller codes
- Reed–Muller Codes: Theory and Algorithms
- On the covering radius of Reed-Solomon codes
Cites work
- A New Upper Bound for the Dimension of Trace Codes
- Algebraic function fields and codes
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Generators and irreducible polynomials over finite fields
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- On Deciding Deep Holes of Reed-Solomon Codes
- On error distance of Reed-Solomon codes
- On the dimension of trace codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On the subset sum problem over finite fields
Cited in
(22)- On error distance of Reed-Solomon codes
- A brief history of the development of error correcting codes
- On deep holes of Gabidulin codes
- Some results on ordinary words of standard Reed-Solomon codes
- Exploiting the cannibalistic traits of Reed-Solomon codes
- Advances in the performance of Reed-Solomon codes
- Deep holes in Reed-Solomon codes based on Dickson polynomials
- Computing error distance of Reed-Solomon codes
- On the error distance of extended Reed-Solomon codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- On Diamond codes
- scientific article; zbMATH DE number 1498826 (Why is no real title available?)
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Repairing Reed-Solomon Codes
- Sparse and Balanced Reed–Solomon and Tamo–Barg Codes
- Theory and applications of Raptor codes
- Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
- On ordinary words of standard Reed-Solomon codes over finite fields
- Repairing Reed-solomon codes
- On the error-correcting pair for MDS linear codes with even minimum distance
- An improvement for error-correcting pairs of some special MDS codes
- New identities relating wild Goppa codes
This page was built for publication: On Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430341)
