|
%I #11 Jun 10 2020 17:43:08
%S 0,7,25,30,42,45,51,52,75,76,82,85,97,102,120,127,385,390,408,415,427,
%T 428,434,437,458,461,467,468,480,487,505,510,642,645,667,668,680,687,
%U 689,694,713,718,720,727,739,740,762,765,771,772,794,797,809
%N List of codewords in binary lexicode with Hamming distance 3 written as decimal numbers.
%C This is also the (infinite) d=3 Hamming code.
%H Rémy Sigrist, <a href="/A075926/b075926.txt">Table of n, a(n) for n = 0..8191</a>
%H J. H. Conway and N. J. A. Sloane, <a href="https://doi.org/10.1109/TIT.1986.1057187">Lexicographic codes: error-correcting codes from game theory</a>, IEEE Transactions on Information Theory, 32:337-348, 1986.
%H R. W. Hamming, <a href="https://signallake.com/innovation/hamming.pdf">Error Detecting and Error Correcting Codes</a>, Bell System Tech. J., Vol. 29, April, 1950, pp. 147-160.
%H Ari Trachtenberg, <a href="http://ipsit.bu.edu/phdthesis_html/phdthesis_html.html">Error-Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs</a>
%Y Cf. A075928, A075929, A075930, A075927, A057716, A075931.
%K nonn,easy,base
%O 0,2
%A Bob Jenkins (bob_jenkins(AT)burtleburtle.net)
|
