Some bounds for the minimum length of binary linear codes of dimension nine

Authors
Bouyukliev, I Guritman, S Vavrek, V
Citation
I. Bouyukliev et al., Some bounds for the minimum length of binary linear codes of dimension nine, IEEE INFO T, 46(3), 2000, pp. 1053-1056
Citations number
13
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
46
Issue
3
Year of publication
2000
Pages
1053 - 1056
Database
ISI
SICI code
0018-9448(200005)46:3<1053:SBFTML>2.0.ZU;2-P
Abstract
We prove the nonexistence of binary [69,9,32] codes and construct codes wit h parameters [76,9,34],[297,9,146], and [300,9,148]. These results show tha t n(9,32) = 70, n(9,34) less than or equal to 76,n(9,146) = 297, and n(9,14 8) = 300, where n(k, d) denotes the smallest value of n for which there exi sts an [n, k, d] binary code. We also present some codes of minimum distanc e 32 and some related codes.