Pages that link to "Item:Q629753"
From MaRDI portal
The following pages link to New upper bounds on codes via association schemes and linear programming (Q629753):
Displayed 6 items.
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- Commutative association schemes (Q1039424) (← links)
- Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← links)
- Two-weight and three-weight linear codes constructed from Weil sums (Q2144168) (← links)
- Constructing error-correcting binary codes using transitive permutation groups (Q2410250) (← links)
- A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646) (← links)