eprintid: 220
rev_number: 18
eprint_status: archive
userid: 7
dir: disk0/00/00/02/20
datestamp: 2009-05-18 10:21:10
lastmod: 2015-05-29 19:49:47
status_changed: 2009-05-18 10:21:10
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Cumberbatch, E.
creators_name: Cummings, L.J.
creators_name: Ferguson, P.
creators_name: Mercer, I.
creators_name: Please, C.P.
creators_name: Tilley, B.
creators_name: Altalli, R.
creators_name: Cao, L.
creators_name: Chen, F.
creators_name: Li, S.
creators_name: Liang, H.
creators_name: Liu, Y.
creators_name: Miller, J.
creators_name: Nguyen, L.
creators_name: Salem, M.
creators_name: Vu, P.D.
creators_name: Watt, J.
creators_name: Yang, Y.
corp_creators: G. Coxson
title: Do the Barker Codes End?
ispublished: pub
subjects: telecom
studygroups: mpi24
companyname: Technology Service Corporation
full_text_status: public
abstract: A Barker code is a binary code with k^th autocorrelation <= 1 for all nonzero k.

At the workshop, the Barker code group split into four non-disjoint subgroups:

- An "algebra group", who explored symmetries of the search space that preserve the autocorrelations' magnitude.
- A "computing group", who explored methods for quickly finding binary codes with very good autocorrelation properties.
- A "statistics group", who explored ways to quantify what has been empirically observed about autocorrelation in the search space S_2^N.
- A "continuous group", who explored a non-discrete analogue of the problem of finding sequences with good autocorrelations.
date: 2008
citation:   Cumberbatch, E. and Cummings, L.J. and Ferguson, P. and Mercer, I. and Please, C.P. and Tilley, B. and Altalli, R. and Cao, L. and Chen, F. and Li, S. and Liang, H. and Liu, Y. and Miller, J. and Nguyen, L. and Salem, M. and Vu, P.D. and Watt, J. and Yang, Y.  (2008) Do the Barker Codes End?  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/220/1/mpi-barker.pdf