Pages that link to "Item:Q3546964"
From MaRDI portal
The following pages link to Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964):
Displaying 17 items.
- On the error distance of extended Reed-Solomon codes (Q326319) (← links)
- Key masking using biometry (Q764394) (← links)
- Power error locating pairs (Q782853) (← links)
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- On error distance of Reed-Solomon codes (Q1042798) (← links)
- On deep holes of Gabidulin codes (Q1800701) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- On deep holes of standard Reed-Solomon codes (Q1934405) (← links)
- On deep holes of generalized Reed-Solomon codes (Q2335176) (← links)
- Some results on deep holes of generalized projective Reed-Solomon codes (Q2335326) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702) (← links)
- Basics of Secrecy Coding (Q3462200) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius (Q5041210) (← links)