The following pages link to (Q3546840):
Displayed 6 items.
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- New lower bounds on \(q\)-ary error-correcting codes (Q2325290) (← links)
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921) (← links)
- Constructing error-correcting binary codes using transitive permutation groups (Q2410250) (← links)
- Two new four-error-correcting binary codes (Q2572972) (← links)
- A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646) (← links)