|
Search: id:A057591
|
|
|
| A057591 |
|
Maximal size of binary code of length n that corrects 2 deletions. |
|
+0
3
|
| |
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
N. J. A. Sloane, On single-deletion-correcting codes, in Codes and Designs (Columbus, OH, 2000), 273-291, Ohio State Univ. Math. Res. Inst. Publ., 10, de Gruyter, Berlin, 2002.
|
|
LINKS
|
N. J. A. Sloane, Challenge Problems: Independent Sets in Graphs
N. J. A. Sloane, On single-deletion-correcting codes
|
|
CROSSREFS
|
Cf. A000016, A057608, A057657, A010101.
Sequence in context: A074765 A029045 A152432 this_sequence A024405 A082547 A068928
Adjacent sequences: A057588 A057589 A057590 this_sequence A057592 A057593 A057594
|
|
KEYWORD
|
nice,hard,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 05 2000
|
|
EXTENSIONS
|
Guenter Stertenbrink (Sterten(AT)aol.com) found a(9) = 11 and a(10) >= 16, Apr 28, 2001.
James B. Shearer (jbs(AT)pkmfgvm4.vnet.ibm.com) proved that a(10 = 16, Sep 20, 2003.
|
|
|
Search completed in 0.002 seconds
|
