Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A010671
%S A010671 1,1,1,1,1,2,2,2,2,2,6,8
%N A010671 Maximal size of binary code of length n correcting 4 unidirectional errors.
%D A010671 J. H. Weber, Bounds and Constructions for Binary Block Codes Correcting 
               Asymmetric or Unidirectional Errors, Ph. D. Thesis, Tech. Univ. Delft, 
               1989.
%D A010671 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.
%Y A010671 Sequence in context: A112968 A104588 A157279 this_sequence A088050 A058005 
               A095386
%Y A010671 Adjacent sequences: A010668 A010669 A010670 this_sequence A010672 A010673 
               A010674
%K A010671 nonn
%O A010671 1,6
%A A010671 N. J. A. Sloane (njas(AT)research.att.com).

    
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 December 4 12:48 EST 2009. Contains 170310 sequences.


AT&T Labs Research