A102482 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, 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, 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, 9, 8, 7, 6, 6, 4, 4, 3, 2, 2, 1

Offset

1,2

References

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

Links

Table of n, a(n) for n=1..78.

Example

Table begins:
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

Crossrefs

Cf. A102481.

Sequence in context: A361642 A226620 A194877 * A194908 A004736 A373214

Adjacent sequences: A102479 A102480 A102481 * A102483 A102484 A102485

Keyword

nonn,tabl

Author

N. J. A. Sloane, Feb 24 2005

Status

approved