Pages that link to "Item:Q4544744"
From MaRDI portal
The following pages link to A table of upper bounds for binary codes (Q4544744):
Displaying 12 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- New lower bounds on \(q\)-ary error-correcting codes (Q2325290) (← links)
- The packing chromatic number of hypercubes (Q2352790) (← links)
- Constructing error-correcting binary codes using transitive permutation groups (Q2410250) (← links)
- Two new four-error-correcting binary codes (Q2572972) (← links)
- (Q3115648) (← links)
- A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646) (← links)
- Packing coloring of hypercubes with extended Hamming codes (Q6633542) (← links)