A209356 The function g(n), the inverse of f(k) the shortest length of a binary linear intersecting code.

2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 6

Offset

3,1

Comments

Table 1, p. 4 of Alahmadi, of g(n) for 3 <= n <= 15.

References

N. J. A. Sloane, Covering Arrays and Intersecting Codes, J. Combinatorial Designs, 1 (1993), 51-63.

Links

Table of n, a(n) for n=3..15.

A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Solé, C. Thomassen, The maximum number of minimal codewords in an [n,k]-code, arXiv:1203.0728v1 [cs.IT], Mar 4, 2012.

Crossrefs

Cf. A209334.

Sequence in context: A192543 A082964 A285524 * A099741 A047743 A062299

Adjacent sequences: A209353 A209354 A209355 * A209357 A209358 A209359

Keyword

nonn

Author

Jonathan Vos Post, Mar 06 2012

Status

approved