login
A209356
The function g(n), the inverse of f(k) the shortest length of a binary linear intersecting code.
0
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
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
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Mar 06 2012
STATUS
approved