A010238 - OEIS

This site is supported by donations to The OEIS Foundation.

A010238

Maximal size of binary code of length n and asymmetric distance 3.

1, 1, 2, 2, 2, 4, 4, 7, 12, 18 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,3`
	REFERENCES	`T. Etzion, New lower bounds for asymmetric and unidirectional codes, IEEE Trans. Inform. Theory, 37 (1991), 1696-1705.` `J. H. Weber, Bounds and Constructions for Binary Block Codes Correcting Asymmetric or Unidirectional Errors, Ph. D. Thesis, Tech. Univ. Delft, 1989.` `J. H. Weber, C. de Vroedt and D. E. Boekee, Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6, IEEE Trans. Inform. Theory, 34 (1988), 1321-1332.`
	LINKS	`Table of n, a(n) for n=1..10.`
	CROSSREFS	`Sequence in context: A173388 A097196 A132325 * A178799 A089819 A059888` `Adjacent sequences: A010235 A010236 A010237 * A010239 A010240 A010241`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane.`
	STATUS	`approved`

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

Last modified June 19 04:22 EDT 2013. Contains 226390 sequences.