|
%I #14 Dec 06 2015 08:56:15
%S 2,3,4,5,8,18,28,50,100,171,316
%N Maximal size of binary code of length n that corrects one transposition (end-around transposition included).
%D S. Butenko, P. Pardalos, I. Sergienko, V. P. Shylo and P. Stetsyuk, Estimating the size of correcting codes using extremal graph problems, Optimization, 227-243,
%D Springer Optim. Appl., 32, Springer, New York, 2009.
%D 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.
%H N. J. A. Sloane, <a href="/A265032/a265032.html">Challenge Problems: Independent Sets in Graphs</a>
%H N. J. A. Sloane, <a href="http://neilsloane.com/doc/dijen.txt">On single-deletion-correcting codes</a>
%Y Cf. A057608, A000016, A057591. Row sums of A085685.
%K nice,hard,nonn
%O 1,1
%A _N. J. A. Sloane_, Oct 15 2000
%E Typo in a(8) corrected and a(9) added, Jul 09, 2003
%E a(9) = 100 from Butenko et al., Nov 28 2001 (see reference). Confirmed by _N. J. A. Sloane_, Jul 09 2003
%E a(10) >= 171 and a(100) >= 316 from Butenko et al., Nov 28 2001 (see reference).
%E a(10) = 171 from Brian Borchers (borchers(AT)nmt.edu), Apr 14 2005
%E a(11) = 316 from Brian Borchers (borchers(AT)nmt.edu), Nov 04 2009
|
