id:A098068 - OEIS Search Results

Search: id:A098068

Displaying 1-1 of 1 results found.

page 1

If C is a doubly-even binary code of length N=24m+n, 1 <= n <= 24, then the minimum distance of C^perp is bounded above by 4m+a(n).

+0
2

1, 1, 1, 2, 1, 2, 3, 4, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 3, 4, 5, 6, 7, 8 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`Coincides with beginning of A066016, although of course that sequence is infinite.`
	REFERENCES	`E. M. Rains, Bounds for self-dual codes over Z_4, Finite Fields Appl. 6 (2000), 146-163.`
	CROSSREFS	`Adjacent sequences: A098065 A098066 A098067 this_sequence A098069 A098070 A098071` `Sequence in context: A022876 A014781 A066016 this_sequence A075425 A074294 A062050`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`njas, Sep 13 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.