Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010238
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A010238 Maximal size of binary code of length n and asymmetric distance 3. +0
3
1, 1, 2, 2, 2, 4, 4, 7, 12, 18 (list; graph; listen)
OFFSET

1,3

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: A008331 A097196 A132325 this_sequence A089819 A059888 A151680

Adjacent sequences: A010235 A010236 A010237 this_sequence A010239 A010240 A010241

KEYWORD

nonn

AUTHOR

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research