On the error distance of extended Reed-Solomon codes
From MaRDI portal
(Redirected from Publication:326319)
Recommendations
Cites work
- scientific article; zbMATH DE number 2115006 (Why is no real title available?)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- Computing error distance of Reed-Solomon codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Deep holes of generalized Reed-Solomon codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- On Cryptosystems Based on Polynomials and Finite Fields
- On Deciding Deep Holes of Reed-Solomon Codes
- On Determining Deep Holes of Generalized Reed-Solomon Codes
- On Reed-Solomon codes
- On deep holes of standard Reed-Solomon codes
- On error distance of Reed-Solomon codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On the subset sum problem over finite fields
- Singularities of symmetric hypersurfaces and Reed-Solomon codes
Cited in
(9)- On ordinary words of standard Reed-Solomon codes over finite fields
- Subset sums over Galois rings
- Some results on ordinary words of standard Reed-Solomon codes
- Error distance of standard Reed-Solomon codes
- A generalization of the Lee distance and error correcting codes
- Computing error distance of Reed-Solomon codes
- On error distance of Reed-Solomon codes
- Subset sums over Galois rings. II
- Counting polynomials with distinct zeros in finite fields
This page was built for publication: On the error distance of extended Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326319)
