Triangle T(m,R) (1 <= R <= m) giving shortest possible length n of an [n,n-m] binary linear code with covering radius R.

A060451

Triangle T(m,R) (1 <= R <= m) giving shortest possible length n of an [n,n-m] binary linear code with covering radius R.

Terms

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

External references