login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010334 Maximal size of binary code of length n and asymmetric distance 4. 0
1, 1, 1, 2, 2, 2, 2, 4, 4, 6, 8, 12, 18 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

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.

CROSSREFS

Sequence in context: A032576 A071809 A104976 * A010578 A005866 A125584

Adjacent sequences:  A010331 A010332 A010333 * A010335 A010336 A010337

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

There is a typo at the n=6 term in the printed version of the paper.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 15 13:09 EST 2012. Contains 205789 sequences.