Abstract
We prove two new upper bounds on the size of binary codes with a minimum distance of three, namely A(10, 3)≤76 and A(11, 3)≤152.
Original language | English |
---|---|
Pages (from-to) | 219-227 |
Number of pages | 9 |
Journal | Designs, Codes, and Cryptography |
Volume | 6 |
Issue number | 3 |
DOIs | |
State | Published - Nov 1995 |
Keywords
- bounds on the size of a code
- constant-weight codes
- optimal codes