Recommendations
- Improved lower bounds on sizes of single-error correcting codes
- Some Bounds on the Size of Codes
- Improved Semidefinite Programming Bound on Sizes of Codes
- scientific article; zbMATH DE number 3410920
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- scientific article; zbMATH DE number 3478749
- New upper bounds on Lee codes
- Improved lower bounds for multicovering codes
- Upper Bounds on the Size of Grain-Correcting Codes
- scientific article; zbMATH DE number 1284417
Cited in
(34)- On the failing cases of the Johnson bound for error-correcting codes
- Commutative association schemes
- Linear programming bounds for codes of small size
- New nonbinary code bounds based on divisibility arguments
- Improved linear programming bound on sizes of doubly constant-weight codes
- Slight improvements of the Singleton bound
- The clique distribution in powers of hypercubes
- New code upper bounds for the folded \(n\)-cube
- Constructing error-correcting binary codes using transitive permutation groups
- New upper bounds on Lee codes
- Numerical results on the asymptotic rate of binary codes
- A new upper bound for single error-correcting codes
- Some Bounds on the Size of Codes
- scientific article; zbMATH DE number 3859031 (Why is no real title available?)
- Bounds on distance distributions in codes of given size
- scientific article; zbMATH DE number 4135866 (Why is no real title available?)
- Upper Bounds on Separating Codes
- Fundamentals of coding type problems
- On optimal binary codes with unbalanced coordinates
- scientific article; zbMATH DE number 3952664 (Why is no real title available?)
- scientific article; zbMATH DE number 3685396 (Why is no real title available?)
- scientific article; zbMATH DE number 3685402 (Why is no real title available?)
- New inequalities for q-ary constant-weight codes
- scientific article; zbMATH DE number 3478749 (Why is no real title available?)
- Upper bounds on the cardinality of a binary code with a given minimum distance
- A table of upper bounds for binary codes
- A simple proof of the improved Johnson bound for binary codes
- Construction of several classes of maximum codes
- An Integer Program for Codes
- scientific article; zbMATH DE number 4183333 (Why is no real title available?)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- New upper bounds on codes via association schemes and linear programming
- New dimension-independent upper bounds on linear insdel codes
- Subspace coverings with multiplicities
This page was built for publication: Improved upper bounds on sizes of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674469)
