|
|
A091704
|
|
Number of Barker codes (or Barker sequences) of length n up to reversals and negations.
|
|
4
|
|
|
2, 1, 2, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
It is conjectured that there are no Barker codes of length > 13.
If there are any nonzero terms for n > 13, they are either at n = 3979201339721749133016171583224100 or at n larger than 4 * 10^33 (Borwein & Mossinghoff, 2014). - Felix Fröhlich, Feb 08 2017
|
|
REFERENCES
|
R. H. Barker, Group synchronizing of binary digital sequences, in "Communication Theory", Butterworth, London, 1953, pp. 273-287.
H. D. Lueke, Korrelationssignale, Springer 1992.
|
|
LINKS
|
R. Turyn and J. Storer, On binary sequences, Proceedings of the American Mathematical Society, vol. 12, no. 3, pp. 394-399, 1961.
|
|
EXAMPLE
|
{{+, +}, {+, -}},
{{+, +, -}},
{{+, +, +, -}, {+, +, -, +}},
{{+, +, +, -, +}},
{{+, +, +, -, -, +, -}},
{{+, +, +, -, -, -, +, -, -, +, -}},
{{+, +, +, +, +, -, -, +, +, -, +, -, +}}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|