Pages that link to "Item:Q3521927"
From MaRDI portal
The following pages link to Complexity of Decoding Positive-Rate Reed-Solomon Codes (Q3521927):
Displaying 9 items.
- A new sieve for distinct coordinate counting (Q625832) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702) (← links)
- Complexity and sliding-block decodability (Q3129478) (← links)
- Power Decoding of Reed–Solomon Codes Revisited (Q3460479) (← links)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- On the complexity of decoding Reed-Solomon codes (Corresp.) (Q4081130) (← links)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes (Q5281271) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)