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

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

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

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

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

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

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

%e Table begins:

%e 1 1

%e 2 2 1 1

%e 3 3 2 2 1 1

%e 4 4 3 3 2 2 1 1

%e 5 5 4 4 3 3 2 2 1 1

%e 6 6 5 4 4 4 3 2 2 2 1 1

%Y Cf. A102482.

%K nonn,tabf

%O 1,3

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