|
%I M0226 #56 Feb 02 2020 19:55:25
%S 1,1,1,1,1,1,1,2,2,2,2,4,4,8,16,32,36,64,128,256,512,1024,2048,4096
%N The coding-theoretic function A(n,8).
%C Since A(n,7) = A(n+1,8), A(n,7) gives essentially the same sequence.
%C The next term, A(25,8), is known to be at least 4096 and at most 5421. - _Moshe Milshtein_, Dec 03 2018
%D J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 248.
%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 674.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A. E. Brouwer, <a href="http://www.win.tue.nl/~aeb/codes/binary-1.html">Small binary codes: Table of general binary codes</a>, personal web page.
%H A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, <a href="http://dx.doi.org/10.1109/18.59932">New table of constant weight codes</a>, IEEE Trans. Info. Theory 36 (1990), 1334-1380.
%H Patric R. J. Östergård, <a href="https://doi.org/10.1109/TIT.2011.2144955">On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16</a>, IEEE Transactions on Information Theory, Volume 57, Issue 10, Oct. 2011.
%H N. J. A. Sloane and D. S. Whitehead, <a href="http://neilsloane.com/doc/whitehead.html">A New Family of Single-Error Correcting Codes</a> [Shows a(18) >= 36.]
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Error-CorrectingCode.html">Error-Correcting Code.</a>
%H <a href="/index/Aa#And">Index entries for sequences related to A(n,d)</a>
%Y Cf. A005864: A(n,4) and A(n,3), A005865: A(n,6) and A(n,5).
%Y Cf. A005851: A(n,8,5), A005852: A(n,8,6), A005853: A(n,8,7), A004043: A(n,8,8).
%K nonn,hard,nice
%O 1,8
%A _N. J. A. Sloane_
%E a(18)-a(24) from _Moshe Milshtein_, Dec 03 2018
|
