Pages that link to "Item:Q4674469"

The following pages link to Improved upper bounds on sizes of codes (Q4674469):

Displaying 23 items.

• On optimal binary codes with unbalanced coordinates (Q371241) (← links)
• New inequalities for \(q\)-ary constant-weight codes (Q398941) (← links)
• New upper bounds on codes via association schemes and linear programming (Q629753) (← links)
• On the failing cases of the Johnson bound for error-correcting codes (Q1010772) (← links)
• Commutative association schemes (Q1039424) (← links)
• Linear programming bounds for codes of small size (Q1367593) (← links)
• New nonbinary code bounds based on divisibility arguments (Q1741925) (← links)
• Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← links)
• Slight improvements of the Singleton bound (Q1887651) (← links)
• The clique distribution in powers of hypercubes (Q2235258) (← links)
• New code upper bounds for the folded \(n\)-cube (Q2299631) (← links)
• Constructing error-correcting binary codes using transitive permutation groups (Q2410250) (← links)
• New upper bounds on Lee codes (Q2492226) (← links)
• Numerical results on the asymptotic rate of binary codes (Q2717190) (← links)
• A new upper bound for single error-correcting codes (Q2770349) (← links)
• Some Bounds on the Size of Codes (Q2986470) (← links)
• (Q3328452) (← links)
• Upper Bounds on Separating Codes (Q3546728) (← links)
• Fundamentals of coding type problems (Q3637813) (← links)
• A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646) (← links)
• Construction of several classes of maximum codes (Q5063292) (← links)
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
• Subspace coverings with multiplicities (Q6632776) (← links)