login
Table read by rows: T(n,k) = highest minimal weight of linear code of length n over GF(4) containing 4^k words (n >= 1, 1 <= k <= n).
1

%I #3 Mar 30 2012 16:50:10

%S 1,2,1,3,2,1,4,3,2,1,5,4,3,2,1,6,4,4,2,2,1,7,5,4,3,2,2,1,8,6,5,4,3,2,

%T 2,1,9,7,6,5,4,3,2,2,1,10,8,6,6,5,4,3,2,2,1,11,8,7,6,6,5,4,3,2,2,1,12,

%U 9,8,7,6,6,4,4,3,2,2,1

%N Table read by rows: T(n,k) = highest minimal weight of linear code of length n over GF(4) containing 4^k words (n >= 1, 1 <= k <= n).

%D A. Blokhuis and A. E. Brouwer, Some small additive quaternary codes, Europ. J. Combin., 25 (2004), 161-167.

%e Table begins:

%e 1

%e 2 1

%e 3 2 1

%e 4 3 2 1

%e 5 4 3 2 1

%e 6 4 4 2 2 1

%e 7 5 4 3 2 2 1

%Y Cf. A102481.

%K nonn,tabl

%O 1,2

%A _N. J. A. Sloane_, Feb 24 2005