Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials

zbMATH Open0834.94018MaRDI QIDQ1897984

V. M. Sidel'nikov

Publication date: 17 September 1995

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

symmetric polynomialsReed-Solomon codesdecoding algorithm

Mathematics Subject Classification ID

Realizations from input-output data (93B15) Decoding (94B35)

Related Items (3)

Repairing Reed-Solomon Codes via Subspace Polynomials ⋮ Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders ⋮ Decoding of redundant residue polynomial codes using Euclid's algorithm

Recommendations

• Unnamed Item 👍 👎
• The decoding of extended Reed-Solomon codes 👍 👎
• Two new decoding algorithms for Reed-Solomon codes 👍 👎
• Decoding of Reed Solomon codes beyond the error-correction bound 👍 👎
• On the complexity of decoding Reed-Solomon codes (Corresp.) 👍 👎
• Improved decoding of Reed-Solomon and algebraic-geometry codes 👍 👎
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance 👍 👎
• A Decoding Approach to Reed–Solomon Codes from Their Definition 👍 👎
• Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes 👍 👎
• An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes 👍 👎

This page was built for publication: Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials