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.

1, 3, 2, 7, 4, 3, 15, 5, 5, 4, 31, 9, 6, 6, 5, 63, 13, 7, 7, 7, 6, 127, 19, 11, 8, 8, 8, 7, 255

Offset

1,2

References

G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 202.

Links

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

Index entries for sequences related to covering codes

Example

1; 3,2; 7,4,3; 15,5,5,4; 31,9,6,6,5; ...

Crossrefs

Cf. A060450.

Sequence in context: A350001 A344969 A011772 * A220291 A129187 A166532

Adjacent sequences: A060448 A060449 A060450 * A060452 A060453 A060454

Keyword

nonn,tabl,nice,hard

Author

N. J. A. Sloane, Apr 08 2001

Extensions

The next entry, T(8,2), is 25 or 26.

Status

approved