On Deciding Deep Holes of Reed-Solomon Codes

DOI10.1007/978-3-540-72504-6_27zbMath1198.94189arXivcs/0509065OpenAlexW1565759886MaRDI QIDQ5425443

Elizabeth Murray, Qi Cheng

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0509065

zbMATH Keywords

Reed-Solomon codesNP-completealgebraic surfacedeep hole

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items

Some results on ordinary words of standard Reed-Solomon codes ⋮ Deep holes in Reed-Solomon codes based on Dickson polynomials ⋮ On the error distance of extended Reed-Solomon codes ⋮ Subset sums of quadratic residues over finite fields ⋮ Counting polynomials over finite fields with prescribed leading coefficients and linear factors ⋮ On deep holes of standard Reed-Solomon codes ⋮ A new sieve for distinct coordinate counting ⋮ Subset sums over Galois rings. II ⋮ Rational points on complete symmetric hypersurfaces over finite fields ⋮ On Reed-Solomon codes ⋮ On the value set of small families of polynomials over a finite field. I ⋮ Counting subset sums of finite Abelian groups ⋮ On the subset sum problem for finite fields ⋮ The \(k\)-subset sum problem over finite fields ⋮ Estimates on the number of \(\mathbb{F}_q\)-rational solutions of variants of diagonal equations over finite fields ⋮ On the subset sum problem over finite fields ⋮ A new sieve for restricted multiset counting ⋮ On deep holes of Gabidulin codes ⋮ Moment subset sums over finite fields ⋮ Subset sums over Galois rings ⋮ On error distance of Reed-Solomon codes ⋮ On deep holes of generalized Reed-Solomon codes