A060450 Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code.

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

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

Table of n, a(n) for n=1..105.

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: A308061 A339448 A060582 * A180918 A152146 A025860

Adjacent sequences: A060447 A060448 A060449 * A060451 A060452 A060453

Keyword

nonn,tabl,nice

Author

N. J. A. Sloane, Apr 08 2001

Status

approved