The linear programming bound for binary linear codes
From MaRDI portal
Recommendations
Cited in
(34)- A search algorithm for linear codes: Progressive dimension growth
- Linear programming bounds for codes via a covering argument
- Linear programming bounds for codes of small size
- Linear codes and character sums
- Antichain codes
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Linear programming bounds for distributed storage codes
- The linear programming bound for codes over finite Frobenius rings
- Numerical results on the asymptotic rate of binary codes
- scientific article; zbMATH DE number 4218008 (Why is no real title available?)
- scientific article; zbMATH DE number 4135866 (Why is no real title available?)
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
- Fundamentals of coding type problems
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 4123671 (Why is no real title available?)
- scientific article; zbMATH DE number 729928 (Why is no real title available?)
- Linear programming bounds for doubly-even self-dual codes
- scientific article; zbMATH DE number 1123782 (Why is no real title available?)
- scientific article; zbMATH DE number 2077090 (Why is no real title available?)
- scientific article; zbMATH DE number 2116354 (Why is no real title available?)
- Linear Programming Approximations for Index Coding
- A Bound for the Maximum Weight of a Linear Code
- scientific article; zbMATH DE number 2187726 (Why is no real title available?)
- scientific article; zbMATH DE number 2230327 (Why is no real title available?)
- On the minimum average distance of binary codes: Linear programming approach
- The degree of functions and weights in linear codes.
- On the optimum of Delsarte's linear program
- Unique optima of the Delsarte linear program
- One more proof of the first linear programming bound for binary codes and two conjectures
- New upper bounds for the size of permutation codes via linear programming
- On linear codes which attain the Solomon-Stiffler bound
- Nonexistence of near-extremal formally self-dual even codes of length divisible by 8
- A note on formally self-dual even codes of length divisible by 8
This page was built for publication: The linear programming bound for binary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202097)
