Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

Cf. A010101, A010238, A010336.

Sequence in context: A036845 A094269 A157227 this_sequence A001316 A161831 A096865

Adjacent sequences: A054533 A054534 A054535 this_sequence A054537 A054538 A054539

KEYWORD

nonn,nice,hard

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Apr 10 2000

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 18 15:35 EDT 2010. Contains 173617 sequences.


AT&T Labs Research