Pages that link to "Item:Q1367593"
From MaRDI portal
The following pages link to Linear programming bounds for codes of small size (Q1367593):
Displaying 14 items.
- Linear programming bounds for unitary codes (Q540378) (← links)
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets (Q543422) (← links)
- New upper bounds for the size of permutation codes via linear programming (Q612914) (← links)
- Bounds for codes by semidefinite programming (Q735630) (← links)
- Linear programming bounds for codes via a covering argument (Q1017926) (← links)
- Constructions and bounds for batch codes with small parameters (Q1705537) (← links)
- Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← 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)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- Numerical results on the asymptotic rate of binary codes (Q2717190) (← 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)