Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes

DOI10.1109/TIT.2010.2060234MaRDI QIDQ5281271zbMATH OpenFDO

Authors Qi Cheng, Daqing Wan

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Complexity of Decoding Positive-Rate Reed-Solomon Codes
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• Decoding of Reed Solomon codes beyond the error-correction bound
• NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
• The decoding of extended Reed-Solomon codes
• On the decoder error probability for Reed - Solomon codes (Corresp.)
• scientific article; zbMATH DE number 4021023
• Power Decoding of Reed–Solomon Codes Revisited
• scientific article; zbMATH DE number 57521
• A note on the decoding complexity of error-correcting codes

Cited in

(13)

• Distinct coordinate solutions of linear equations over finite fields
• Subset sums over Galois rings
• Constructions of cyclic quaternary constant-weight codes of weight three and distance four
• The \(k\)-subset sum problem over finite fields
• A new sieve for restricted multiset counting
• On the error distance of extended Reed-Solomon codes
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• Cyclic codes from cyclotomic sequences of order four
• Subset sums of quadratic residues over finite fields
• Subset sums over Galois rings. II
• NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
• Counting polynomials with distinct zeros in finite fields
• Maximum-likelihood decoding of Reed-Solomon codes is NP-hard

This page was built for publication: Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes

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