|
%I #7 Dec 21 2015 04:31:00
%S 2,2,2,3,3,3,4,4,4,4,5,5,6
%N The function g(n), the inverse of f(k) the shortest length of a binary linear intersecting code.
%C Table 1, p. 4 of Alahmadi, of g(n) for 3 <= n <= 15.
%D N. J. A. Sloane, Covering Arrays and Intersecting Codes, J. Combinatorial Designs, 1 (1993), 51-63.
%H A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Solé, C. Thomassen, <a href="http://arxiv.org/abs/1203.0728">The maximum number of minimal codewords in an [n,k]-code</a>, arXiv:1203.0728v1 [cs.IT], Mar 4, 2012.
%Y Cf. A209334.
%K nonn
%O 3,1
%A _Jonathan Vos Post_, Mar 06 2012
|
