id:A102482 - OEIS Search Results

Search: id:A102482

Displaying 1-1 of 1 results found.

page 1

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).

+0
2

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 (list; table; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`A. Blokhuis and A. E. Brouwer, Some small additive quaternary codes, Europ. J. Combin., 25 (2004), 161-167.`
	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: A141672 A141671 A088643 this_sequence A004736 A023122 A052310` `Adjacent sequences: A102479 A102480 A102481 this_sequence A102483 A102484 A102485`
	KEYWORD	`nonn,tabl`
	AUTHOR	`njas, Feb 24 2005`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research