|
%I #5 Mar 30 2012 16:49:04
%S 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,
%T 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,
%U 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
%N Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code.
%D G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 193.
%D R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Information Theory, 51 (1985), 385-401.
%H <a href="/index/Coa#covcod">Index entries for sequences related to covering codes</a>
%e 0; 1,0; 1,1,0; 2,1,1,0; 2,2,1,1,0; ...
%Y Cf. A060451.
%K nonn,tabl,nice
%O 1,7
%A _N. J. A. Sloane_, Apr 08 2001
|
