The merit factor of long low autocorrelation binary sequences (Corresp.)

Authors:
M. Golay
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Finding low autocorrelation binary sequences with memetic algorithms

Applied Soft Computing
Low autocorrelation binary sequences: Number theory-based analysis for minimum energy level, Barker codes

Digital Signal Processing
Full length article: Optimal design of phase function in Generalized DFT

Physical Communication
The density of ternary barker sequences

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Advances in the merit factor problem for binary sequences

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	754.84

Visualization

Abstract

The asymptotic "merit factor," i.e, the ratio of central to sidelobe energy of extremely long, optimally Iow autocorrelation sequences, formerly calculated as2e^{2}=14.778 cdotswith the use of an ergodicity hypothesis and a convenient, but faulty, approximation, is recalculated without that approximation and is established at12.32 cdots.