Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010558
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A010558 Maximal size of binary code of length n correcting 2 unidirectional errors. +0
1
1, 1, 1, 2, 2, 2, 4, 6, 10 (list; graph; listen)
OFFSET

1,4

REFERENCES

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

Adjacent sequences: A010555 A010556 A010557 this_sequence A010559 A010560 A010561

Sequence in context: A093393 A090858 A036654 this_sequence A060827 A064355 A000799

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research