A110863 - OEIS

This site is supported by donations to The OEIS Foundation.

A110863

Number of odd formally self-dual binary codes of length 2n that have the highest possible minimal distance.

1, 1, 1, 2, 1, 5, 112, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	REFERENCES	`W. C. Huffman, On the classification and enumeration of self-dual codes, Finite Fields Applic., 11 (2005), 451-490.`
	CROSSREFS	`Sequence in context: A184300 A075403 A187618 * A091615 A175591 A198812` `Adjacent sequences: A110860 A110861 A110862 * A110864 A110865 A110866`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 19 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 10:16 EST 2012. Contains 205614 sequences.