Improved upper bounds on sizes of codes
From MaRDI portal
Publication:4674469
DOI10.1109/18.992776zbMATH Open1061.94083OpenAlexW2116555776MaRDI QIDQ4674469FDOQ4674469
Authors: Benjamin Mounits, Tuvi Etzion, Simon Litsyn 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.992776
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 (27)
- New inequalities for \(q\)-ary constant-weight codes
- A table of upper bounds for binary codes
- Some Bounds on the Size of Codes
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Slight improvements of the Singleton bound
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The clique distribution in powers of hypercubes
- A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES
- Fundamentals of coding type problems
- Constructing error-correcting binary codes using transitive permutation groups
- Upper bounds on the cardinality of a binary code with a given minimum distance
- Subspace coverings with multiplicities
- Numerical results on the asymptotic rate of binary codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- New upper bounds on Lee codes
- Upper Bounds on Separating Codes
- A new upper bound for single error-correcting codes
- On optimal binary codes with unbalanced coordinates
- Title not available (Why is that?)
- Commutative association schemes
- New upper bounds on codes via association schemes and linear programming
- On the failing cases of the Johnson bound for error-correcting codes
- Construction of several classes of maximum codes
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)
