|
Search: id:A060450
|
|
|
| A060450 |
|
Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code. |
|
+0
2
|
|
| 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 1, 0, 3, 2, 2, 1, 1, 0, 3, 3, 2, 1, 1, 1, 0, 4, 3, 3, 2, 1, 1, 1, 0, 4, 4, 3, 2, 2, 1, 1, 1, 0, 5, 4, 4, 3, 2, 2, 1, 1, 1, 0, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 0, 6, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 0, 6, 6, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 0, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
REFERENCES
|
G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 193.
R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Information Theory, 51 (1985), 385-401.
|
|
LINKS
|
Index entries for sequences related to covering codes
|
|
EXAMPLE
|
0; 1,0; 1,1,0; 2,1,1,0; 2,2,1,1,0; ...
|
|
CROSSREFS
|
Cf. A060451.
Sequence in context: A071462 A101979 A060582 this_sequence A025860 A058394 A113661
Adjacent sequences: A060447 A060448 A060449 this_sequence A060451 A060452 A060453
|
|
KEYWORD
|
nonn,tabl,nice
|
|
AUTHOR
|
njas, Apr 08 2001
|
|
|
Search completed in 0.002 seconds
|
