On the error distance of extended Reed-Solomon codes
From MaRDI portal
Publication:326319
DOI10.3934/AMC.2016015zbMATH Open1348.94085OpenAlexW2345387074MaRDI QIDQ326319FDOQ326319
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016015
Recommendations
Cites Work
- On deep holes of standard Reed-Solomon codes
- On Reed-Solomon codes
- On Determining Deep Holes of Generalized Reed-Solomon Codes
- Computing Error Distance of Reed-Solomon Codes
- Singularities of symmetric hypersurfaces and Reed-Solomon codes
- Deep holes of generalized Reed-Solomon codes
- On Deciding Deep Holes of Reed-Solomon Codes
- On the subset sum problem over finite fields
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- On error distance of Reed-Solomon codes
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- On Cryptosystems Based on Polynomials and Finite Fields
- Title not available (Why is that?)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
Cited In (5)
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)
