On error distance of Reed-Solomon codes

DOI10.1007/S11425-008-0066-3MaRDI QIDQ1042798zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On Reed-Solomon codes
• Computing error distance of Reed-Solomon codes
• On the error distance of extended Reed-Solomon codes
• Error distance of standard Reed-Solomon codes
• Complexity of Decoding Positive-Rate Reed-Solomon Codes

Cites work

• Decoding of Reed Solomon codes beyond the error-correction bound
• Generators and irreducible polynomials over finite fields
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• On Deciding Deep Holes of Reed-Solomon Codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes

Cited in

(22)

• On deep holes of Gabidulin codes
• On deep holes of standard Reed-Solomon codes
• A new sieve for restricted multiset counting
• Extensions of Schönemann's theorem in Galois rings
• Some results on ordinary words of standard Reed-Solomon 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
• On Reed-Solomon codes
• A generalization of the Lee distance and error correcting codes
• Computing error distance of Reed-Solomon codes
• Error distance of standard Reed-Solomon codes
• On the error distance of extended Reed-Solomon codes
• Counting polynomials with distinct zeros in finite fields
• Distance Distribution in Reed-Solomon Codes
• On ordinary words of standard Reed-Solomon codes over finite fields
• Subset sums over Galois rings. II
• A new sieve for distinct coordinate counting
• Deep holes of twisted Reed-Solomon codes
• Counting polynomials with distinct zeros in Galois ring \(\mathrm{GR}(p^2,r)\)
• Smooth symmetric systems over a finite field and applications
• On the subset sum problem over finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042798)