Binary sequences with merit factor >6.3

A method is described for the construction of binary sequences of very long length and with asymptotic merit factor>6.3. The result is backed up by strong experimental evidence although no formal proof for the asymptote is known. The sequences were found by Kristiansen using a small deterministic...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2004-12, Vol.50 (12), p.3385-3389
Hauptverfasser:	Kristiansen, R.A., Parker, M.G.
Format:	Artikel
Sprache:	eng
Schlagworte:	Aperiodic autocorrelation Autocorrelation Binary sequences Chemistry Codes Councils Exact sciences and technology Information theory Jacobian matrices L4 norm Legendre sequence Magneto electrical resistivity imaging technique Mathematical analysis Mathematics merit factor Physics quadratic residue sequence Sciences and techniques of general use Sequences, series, summability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A method is described for the construction of binary sequences of very long length and with asymptotic merit factor>6.3. The result is backed up by strong experimental evidence although no formal proof for the asymptote is known. The sequences were found by Kristiansen using a small deterministic search, which we describe. Borwein, Choi, and Jedwab have independently identified a merit factor asymptote of 6.3421... After we became aware of their work we realized that the sequences we construct are more simply described as periodic extensions of periodically rotated Legendre sequences.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2004.838343