Pages that link to "Item:Q3638889"
From MaRDI portal
The following pages link to Deterministic Approximation Algorithms for the Nearest Codeword Problem (Q3638889):
Displayed 9 items.
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- Learning parities in the mistake-bound model (Q1944027) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
- Sparse Solutions of Linear Diophantine Equations (Q5737776) (← links)
- Improved learning of \(k\)-parities (Q5918966) (← links)