|
Search: id:A057608
|
|
|
| A057608 |
|
Maximal size of binary code of length n that corrects one transposition (end-around transposition not included). |
|
+0
4
|
|
| 1, 2, 3, 4, 8, 12, 20, 38, 63, 110, 196
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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, On single-deletion-correcting codes
N. J. A. Sloane, Challenge Problems: Independent Sets in Graphs
|
|
CROSSREFS
|
Cf. A057657, A000016, A057591, A010101. Row sums of A085684.
Sequence in context: A085635 A013914 A060200 this_sequence A060984 A098348 A131420
Adjacent sequences: A057605 A057606 A057607 this_sequence A057609 A057610 A057611
|
|
KEYWORD
|
nice,hard,nonn
|
|
AUTHOR
|
njas, Oct 09 2000
|
|
EXTENSIONS
|
a(9) = 110 from Butenko et al., Nov 28 2001 (see reference).
a(9) = 110 also from Ketan Narendra Patel (knpatel(AT)eecs.umich.edu), Apr 29 2002. Confirmed by njas, Jul 07 2003
a(10) >= 196 and a(100) >= 352 from Butenko et al., Nov 28 2001 (see reference).
a(10) = 196 found by njas, Jul 17 2003
|
|
|
Search completed in 0.002 seconds
|
