Pages that link to "Item:Q5425443"
From MaRDI portal
The following pages link to On Deciding Deep Holes of Reed-Solomon Codes (Q5425443):
Displaying 22 items.
- Deep holes in Reed-Solomon codes based on Dickson polynomials (Q285466) (← links)
- On the error distance of extended Reed-Solomon codes (Q326319) (← links)
- Subset sums of quadratic residues over finite fields (Q346285) (← links)
- A new sieve for distinct coordinate counting (Q625832) (← links)
- Counting subset sums of finite Abelian groups (Q645970) (← links)
- On the subset sum problem over finite fields (Q958604) (← links)
- On error distance of Reed-Solomon codes (Q1042798) (← links)
- The \(k\)-subset sum problem over finite fields (Q1747922) (← links)
- On deep holes of Gabidulin codes (Q1800701) (← links)
- On deep holes of standard Reed-Solomon codes (Q1934405) (← links)
- Estimates on the number of \(\mathbb{F}_q\)-rational solutions of variants of diagonal equations over finite fields (Q1994944) (← links)
- A new sieve for restricted multiset counting (Q2032908) (← links)
- Some results on ordinary words of standard Reed-Solomon codes (Q2126919) (← links)
- Rational points on complete symmetric hypersurfaces over finite fields (Q2198392) (← links)
- On the subset sum problem for finite fields (Q2238923) (← links)
- Moment subset sums over finite fields (Q2302567) (← links)
- Subset sums over Galois rings (Q2322901) (← links)
- On deep holes of generalized Reed-Solomon codes (Q2335176) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- On the value set of small families of polynomials over a finite field. I (Q2439575) (← links)
- Counting polynomials over finite fields with prescribed leading coefficients and linear factors (Q2672340) (← links)
- Subset sums over Galois rings. II (Q6166733) (← links)
