login
Triangle T(n,k) read by rows giving number of inequivalent projective binary linear [n,k] codes (n >= 1, 1 <= k <= n).
2

%I #6 Mar 30 2012 16:49:31

%S 1,0,1,0,1,1,0,0,2,1,0,0,1,3,1,0,0,1,4,4,1,0,0,1,5,8,5,1,0,0,0,6,15,

%T 14,6,1,0,0,0,5,29,38,22,7,1,0,0,0,4,46,105,80,32,8,1,0,0,0,3,64,273,

%U 312,151,44,9,1,0,0,0,2,89,700,1285,821,266,59,10,1,0,0,0,1,112

%N Triangle T(n,k) read by rows giving number of inequivalent projective binary linear [n,k] codes (n >= 1, 1 <= k <= n).

%C A code is projective if all columns are distinct and nonzero.

%D D. Slepian, Some further theory of group codes. Bell System Tech. J. 39 1960 1219-1252.

%D H. Fripertinger and A. Kerber, in AAECC-11, Lect. Notes Comp. Sci. 948 (1995), 194-204.

%H H. Fripertinger, <a href="http://www.mathe2.uni-bayreuth.de/frib/codes/tables.html">Isometry Classes of Codes</a>

%H <a href="/index/Coa#codes_binary_linear">Index entries for sequences related to binary linear codes</a>

%e 1; 0,1; 0,1,1; 0,0,2,1; 0,0,1,3,1; 0,0,1,4,4,1; 0,0,1,5,8,5,1; ...

%Y Cf. A076834 (row sums). Partial sums across rows gives triangle A091008.

%K nonn,tabl

%O 1,9

%A _N. J. A. Sloane_, Nov 21 2002