On the error distance of extended Reed-Solomon codes

DOI10.3934/amc.2016015zbMath1348.94085OpenAlexW2345387074MaRDI QIDQ326319

Guizhen Zhu, Yujuan Li

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

zbMATH Keywords

decodingReed-Solomon codecoding theoryequation systemerror distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (4)

Some results on ordinary words of standard Reed-Solomon codes ⋮ Subset sums over Galois rings. II ⋮ Counting polynomials with distinct zeros in finite fields ⋮ Subset sums over Galois rings

Cites Work

• Unnamed Item
• Singularities of symmetric hypersurfaces and Reed-Solomon codes
• On the subset sum problem over finite fields
• On error distance of Reed-Solomon codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• 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
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• On Cryptosystems Based on Polynomials and Finite Fields
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Deep holes of generalized Reed-Solomon codes
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• On Deciding Deep Holes of Reed-Solomon Codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes

This page was built for publication: On the error distance of extended Reed-Solomon codes