Pages that link to "Item:Q1017926"
From MaRDI portal
The following pages link to Linear programming bounds for codes via a covering argument (Q1017926):
Displaying 17 items.
- On linear codes which attain the Solomon-Stiffler bound (Q798293) (← links)
- Duality between packings and coverings of the Hamming space (Q874419) (← links)
- Bounds for short covering codes and reactive tabu search (Q968171) (← links)
- Linear programming bounds for codes via a covering argument (Q1017926) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Linear programming bounds for distributed storage codes (Q2176298) (← links)
- Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube (Q2326494) (← links)
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- Solving LPN Using Covering Codes (Q2938835) (← links)
- Linear inequalities for covering codes. I. Pair covering inequalities (Q3358649) (← links)
- Linear inequalities for covering codes. II. Triple covering inequalities (Q4024544) (← links)
- An improvement of the Van Wee bound for binary linear covering codes (Q4324204) (← links)
- (Q4379736) (← links)
- Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров (Q4959067) (← links)
- Linear Programming Approximations for Index Coding (Q5211387) (← links)
- On the optimum of Delsarte's linear program (Q5953375) (← links)
- One more proof of the first linear programming bound for binary codes and two conjectures (Q6050274) (← links)