Linear programming bounds for codes of small size
From MaRDI portal
Recommendations
Cited in
(21)- On the optimum of Delsarte's linear program
- Improved linear programming bound on sizes of doubly constant-weight codes
- Linear programming bounds for codes in grassmannian spaces
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- Bounds on the minimum support weights
- New upper bounds for the size of permutation codes via linear programming
- One more proof of the first linear programming bound for binary codes and two conjectures
- Linear programming bounds for distributed storage codes
- Linear programming bounds for codes via a covering argument
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
- Linear programming bounds
- scientific article; zbMATH DE number 729928 (Why is no real title available?)
- Linear Programming Approximations for Index Coding
- Monotonicity of the quantum linear programming bound
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Bounds for codes by semidefinite programming
- Numerical results on the asymptotic rate of binary codes
- Constructions and bounds for batch codes with small parameters
- Linear programming bounds for unitary codes
- The linear programming bound for binary linear codes
This page was built for publication: Linear programming bounds for codes of small size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367593)
