Pages that link to "Item:Q4581908"
From MaRDI portal
The following pages link to NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908):
Displaying 5 items.
- Moment subset sums over finite fields (Q2302567) (← links)
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702) (← links)
- An improvement of Prouhet’s 1851 result on multigrade chains (Q3303480) (← links)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes (Q5281271) (← links)