Pages that link to "Item:Q2921702"
From MaRDI portal
The following pages link to Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702):
Displaying 6 items.
- Deep holes in Reed-Solomon codes based on Dickson polynomials (Q285466) (← links)
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability (Q2031639) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- On the hardnesses of several quantum decoding problems (Q2677282) (← links)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)