Improved upper bounds on sizes of codes

DOI10.1109/18.992776MaRDI QIDQ4674469zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

Bounds on codes (94B65)

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

(32)

• Improved linear programming bound on sizes of doubly constant-weight codes
• Bounds on distance distributions in codes of given size
• scientific article; zbMATH DE number 3478749 (Why is no real title available?)
• Constructing error-correcting binary codes using transitive permutation groups
• New upper bounds on codes via association schemes and linear programming
• New dimension-independent upper bounds on linear insdel codes
• New upper bounds on Lee codes
• New inequalities for \(q\)-ary constant-weight codes
• scientific article; zbMATH DE number 4135866 (Why is no real title available?)
• On optimal binary codes with unbalanced coordinates
• A table of upper bounds for binary codes
• Fundamentals of coding type problems
• scientific article; zbMATH DE number 3859031 (Why is no real title available?)
• Subspace coverings with multiplicities
• The clique distribution in powers of hypercubes
• Construction of several classes of maximum codes
• A simple proof of the improved Johnson bound for binary codes
• Upper bounds on the cardinality of a binary code with a given minimum distance
• Some Bounds on the Size of Codes
• scientific article; zbMATH DE number 3685402 (Why is no real title available?)
• scientific article; zbMATH DE number 3952664 (Why is no real title available?)
• Commutative association schemes
• scientific article; zbMATH DE number 4183333 (Why is no real title available?)
• New code upper bounds for the folded \(n\)-cube
• Numerical results on the asymptotic rate of binary codes
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• On the failing cases of the Johnson bound for error-correcting codes
• Upper Bounds on Separating Codes
• New nonbinary code bounds based on divisibility arguments
• Slight improvements of the Singleton bound
• scientific article; zbMATH DE number 3685396 (Why is no real title available?)
• A new upper bound for single error-correcting 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)