On Reed-Solomon codes

DOI10.1007/s11401-010-0622-3zbMath1229.94057OpenAlexW2053340927MaRDI QIDQ2430341

Qunying Liao

Publication date: 6 April 2011

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11401-010-0622-3

zbMATH Keywords

Reed-Solomon codeserror-correcting codeslist decoding

Mathematics Subject Classification ID

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

Related Items (5)

Deep holes in Reed-Solomon codes based on Dickson polynomials ⋮ On the error distance of extended Reed-Solomon codes ⋮ On the error-correcting pair for MDS linear codes with even minimum distance ⋮ On deep holes of Gabidulin codes ⋮ New identities relating wild Goppa codes

Cites Work

• Unnamed Item
• Algebraic function fields and 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 the dimension of trace codes
• Complexity of Decoding Positive-Rate Reed-Solomon Codes
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• A New Upper Bound for the Dimension of Trace Codes
• 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 Reed-Solomon codes