|
| |
|
|
A005866
|
|
The coding-theoretic function A(n,8).
(Formerly M0226)
|
|
2
| |
|
|
1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 8, 16, 32, 36
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,8
|
|
|
COMMENTS
| Since A(n,7) = A(n+1,8), A(n,7) gives essentially the same sequence.
The next term (A(17,8)) is known to be at least 64 and at most 72.
|
|
|
REFERENCES
| A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, New table of constant weight codes, IEEE Trans. Info. Theory 36 (1990), 1334-1380.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 674.
P. R. J. Ostergard, On the Size of Optimal Three-Error-Correcting
Binary Codes of Length 16, Preprint, Jan 11 2011.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| S. Litsyn, E. M. Rains and N. J. A. Sloane, A(n,d) tables.
N. J. A. Sloane and D. S. Whitehead, A New Family of Single-Error Correcting Codes [Shows a(18) >= 36.]
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to A(n,d)
|
|
|
CROSSREFS
| Cf. A005864, A005865.
Sequence in context: A104976 A010334 A010578 * A125584 A029078 A131799
Adjacent sequences: A005863 A005864 A005865 * A005867 A005868 A005869
|
|
|
KEYWORD
| nonn,hard,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
