Jump to content

Barker code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Schapel (talk | contribs) at 04:52, 25 March 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A Barker code is a sequence of N values of +1 and -1,

aj for j = 0,1,...,N − 1,

such that

j=0N-v aj aj+v| <= 1

for all 1 <= v < N.

Here is a table of all known Barker codes, where negations and reversals of the codes have been omitted:

Known Barker Codes
Length Codes
2 +1 −1 +1 +1
3 +1 +1 −1
4 +1 −1 +1 +1 +1 −1 −1 −1
5 +1 +1 +1 −1 +1
7 +1 +1 +1 −1 −1 +1 −1
11 +1 +1 +1 −1 −1 −1 +1 −1 −1 +1 −1
13 +1 +1 +1 +1 +1 −1 −1 +1 +1 −1 +1 −1 +1

Barker codes of length 11 and 13 are used in direct-sequence spread spectrum systems because of their low autocorrelation properties.

References

Template:Com-stub