A054536 Maximal size of binary code of length n and asymmetric distance 4.

1, 1, 1, 2, 2, 4, 2, 4, 4, 6, 8, 12, 18

Offset

1,4

Links

Table of n, a(n) for n=1..13.

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.

Crossrefs

Cf. A010101, A010238, A010336.

Sequence in context: A036845 A094269 A157227 * A293664 A001316 A285741

Adjacent sequences: A054533 A054534 A054535 * A054537 A054538 A054539

Keyword

nonn,nice,hard

Author

N. J. A. Sloane, Apr 10 2000

Status

approved