Pages that link to "Item:Q4679877"
From MaRDI portal
The following pages link to Hardness of approximating the minimum distance of a linear code (Q4679877):
Displayed 6 items.
- Key masking using biometry (Q764394) (← links)
- On the De Boer-Pellikaan method for computing minimum distance (Q992803) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)