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

A060450

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

Terms

    a(0) =0a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =2a(7) =1a(8) =1a(9) =0a(10) =2a(11) =2a(12) =1a(13) =1a(14) =0a(15) =3a(16) =2a(17) =2a(18) =1a(19) =1a(20) =0a(21) =3a(22) =3a(23) =2a(24) =1a(25) =1a(26) =1a(27) =0a(28) =4a(29) =3

External references