A010336 Maximal size of binary code of length n and asymmetric distance 5.

1, 1, 1, 1, 2, 2, 2, 2, 2, 4, 4, 4, 6, 8, 12, 16, 26

Offset

1,5

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

Crossrefs

Cf. A010101, A010238, A054536.

Sequence in context: A108105 A321213 A063468 * A054537 A029104 A332886

Adjacent sequences: A010333 A010334 A010335 * A010337 A010338 A010339

Keyword

nonn,nice,hard

Author

N. J. A. Sloane, Apr 10 2000

Status

approved