On error distance of Reed-Solomon codes

DOI10.1007/S11425-008-0066-3zbMath1176.94078OpenAlexW2077712820MaRDI QIDQ1042798

Yujuan Li, Daqing Wan

Publication date: 7 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-008-0066-3

zbMATH Keywords

complexity of decoding Reed-Solomon codeerror distance of received wordnon-existence of deep holeswords with maximal error distance

Mathematics Subject Classification ID

Bounds on codes (94B65) Number-theoretic algorithms; complexity (11Y16) Decoding (94B35)

Related Items (14)

Some results on ordinary words of standard Reed-Solomon codes ⋮ On the error distance of extended Reed-Solomon codes ⋮ On deep holes of standard Reed-Solomon codes ⋮ A new sieve for distinct coordinate counting ⋮ Subset sums over Galois rings. II ⋮ On Reed-Solomon codes ⋮ Counting polynomials with distinct zeros in finite fields ⋮ On the subset sum problem over finite fields ⋮ A new sieve for restricted multiset counting ⋮ On deep holes of Gabidulin codes ⋮ Subset sums over Galois rings ⋮ On deep holes of generalized Reed-Solomon codes ⋮ Some results on deep holes of generalized projective Reed-Solomon codes ⋮ Extensions of Schönemann's theorem in Galois rings

Cites Work

• Decoding of Reed Solomon codes beyond the error-correction bound
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• Generators and irreducible polynomials over finite fields
• Improved decoding of Reed-Solomon and algebraic-geometry 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 error distance of Reed-Solomon codes