|
| |
|
|
A057657
|
|
Maximal size of binary code of length n that corrects one transposition (end-around transposition included).
|
|
3
| |
|
|
2, 3, 4, 5, 8, 18, 28, 50, 100, 171, 316
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| S. Butenko, P. Pardalos, I. Sergienko, V. P. Shylo and P. Stetsyuk, Estimating the size of correcting codes using extremal graph problems, in Optimization: Structure and Applications, edited by Charles Pearce, Kluwer, to appear, 2003.
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. A057608, A000016, A057591. Row sums of A085685.
Sequence in context: A112479 A081711 A055638 * A079383 A103670 A105950
Adjacent sequences: A057654 A057655 A057656 * A057658 A057659 A057660
|
|
|
KEYWORD
| nice,hard,nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Oct 15 2000
|
|
|
EXTENSIONS
| Typo in a(8) corrected and a(9) added, Jul 09, 2003
a(9) = 100 from Butenko et al., Nov 28 2001 (see reference). Confirmed by N. J. A. Sloane (njas(AT)research.att.com), Jul 09 2003
a(10) >= 171 and a(100) >= 316 from Butenko et al., Nov 28 2001 (see reference).
a(10) = 171 from Brian Borchers (borchers(AT)nmt.edu), Apr 14 2005
a(11) = 316 from Brian Borchers (borchers(AT)nmt.edu), Nov 04 2009
|
| |
|
|
