Pages that link to "Item:Q1584302"
From MaRDI portal
The following pages link to A new upper bound for binary codes with minimum distance four (Q1584302):
Displaying 5 items.
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Two new bounds on the size of binary codes with a minimum distance of three (Q1904422) (← links)
- A new upper bound for single error-correcting codes (Q2770349) (← links)
- (Q3030262) (← links)
- A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646) (← links)