Linear programming bounds for codes of small size
From MaRDI portal
Publication:1367593
DOI10.1006/EUJC.1996.0129zbMATH Open0983.94055OpenAlexW1998657826MaRDI QIDQ1367593FDOQ1367593
Publication date: 21 April 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/26051fbba4b66f23f9ad481728b78ed3991954df
Recommendations
linear programmingconstant weight codes[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tiet%EF%BF%BD%EF%BF%BDv%EF%BF%BD%EF%BF%BDinen+bound&go=Go Tiet��v��inen bound]
Cited In (15)
- One more proof of the first linear programming bound for binary codes and two conjectures
- Title not available (Why is that?)
- The linear programming bound for binary linear codes
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Title not available (Why is that?)
- Bounds for codes by semidefinite programming
- Monotonicity of the quantum linear programming bound
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Numerical results on the asymptotic rate of binary codes
- Bounds on the minimum support weights
- Linear programming bounds for distributed storage codes
- On the optimum of Delsarte's linear program
- New upper bounds for the size of permutation codes via linear programming
- Constructions and bounds for batch codes with small parameters
- Linear Programming Approximations for Index Coding
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)
