Skip to main content
Article thumbnail
Location of Repository

Do the Barker Codes End?

By E. Cumberbatch, L.J. Cummings, P. Ferguson, I. Mercer, C.P. Please, B. Tilley, R. Altalli, L. Cao, F. Chen, S. Li, H. Liang, Y. Liu, J. Miller, L. Nguyen, M. Salem, P.D. Vu, J. Watt and Y. Yang


A Barker code is a binary code with k^th autocorrelation <= 1 for all nonzero k.\ud \ud At the workshop, the Barker code group split into four non-disjoint subgroups:\ud \ud - An "algebra group", who explored symmetries of the search space that preserve the autocorrelations' magnitude.\ud - A "computing group", who explored methods for quickly finding binary codes with very good autocorrelation properties.\ud - A "statistics group", who explored ways to quantify what has been empirically observed about autocorrelation in the search space S_2^N.\ud - A "continuous group", who explored a non-discrete analogue of the problem of finding sequences with good autocorrelations

Topics: Information and communication technology
Year: 2008
OAI identifier:

Suggested articles


  1. (1990). Minimum peak sidelobe pulse compression codes”,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.