The smallest length of eight-dimensional binary linear codes with prescribed minimum distance

Authors
Bouyukliev, I Jaffe, DB Vavrek, V
Citation
I. Bouyukliev et al., The smallest length of eight-dimensional binary linear codes with prescribed minimum distance, IEEE INFO T, 46(4), 2000, pp. 1539-1544
Citations number
39
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
46
Issue
4
Year of publication
2000
Pages
1539 - 1544
Database
ISI
SICI code
0018-9448(200007)46:4<1539:TSLOEB>2.0.ZU;2-A
Abstract
Let n(8, d) be the smallest integer a for which a binary Linear code of len gth n, dimension 8, and minimum distance d exists. We prove that n(8, 18) = 42, n(8, 26) = 58, n(8, 28) = 61, n(8, 30) = 65, a(8, 34) = 74, n(8, 36) 7 7, n(8, 38) = 81, n(8, 42) = 89, and n(8, 60) = 124. After these results, a ll values of n(8, d) are known.