Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
From MaRDI portal
Publication:5281271
DOI10.1109/TIT.2010.2060234zbMath1366.94693MaRDI QIDQ5281271
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cyclic codes (94B15) Decoding (94B35)
Related Items (11)
On the error distance of extended Reed-Solomon codes ⋮ Subset sums of quadratic residues over finite fields ⋮ NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ Subset sums over Galois rings. II ⋮ Cyclic codes from cyclotomic sequences of order four ⋮ Counting polynomials with distinct zeros in finite fields ⋮ 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 ⋮ Distinct coordinate solutions of linear equations over finite fields ⋮ Subset sums over Galois rings
This page was built for publication: Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
