A060450 - OEIS

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

(list; table; graph; refs; listen; history; text; internal format)

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