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):
Displaying 21 items.
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- 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)
- Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- As Close as It Gets (Q2803825) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- (Q4638056) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)