Pages that link to "Item:Q5281271"
From MaRDI portal
The following pages link to Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes (Q5281271):
Displaying 11 items.
- On the error distance of extended Reed-Solomon codes (Q326319) (← links)
- Subset sums of quadratic residues over finite fields (Q346285) (← links)
- Counting polynomials with distinct zeros in finite fields (Q503699) (← links)
- Constructions of cyclic quaternary constant-weight codes of weight three and distance four (Q1744017) (← links)
- The \(k\)-subset sum problem over finite fields (Q1747922) (← links)
- A new sieve for restricted multiset counting (Q2032908) (← links)
- Distinct coordinate solutions of linear equations over finite fields (Q2291366) (← links)
- Subset sums over Galois rings (Q2322901) (← links)
- Cyclic codes from cyclotomic sequences of order four (Q2447744) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Subset sums over Galois rings. II (Q6166733) (← links)
