Characterizing the autocorrelations of binary sequences

DOI10.1109/TIT.1983.1056710MaRDI QIDQ4746694zbMATH OpenFDO

Authors J. L. Martins de Carvalho, J. M. C. Clark

Publication date 1983

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1983.1056710

zbMATH Keywords

algorithms for calculation of extreme pointsautocorrelation functions of binary sequencesconvex polyhedrafinite-dimensional projectionstables

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10)

Cited in

(4)

• Systematic sampling for autocorrelated superpopulations
• On a minimum correlation problem.
• Generation of amplitude constrained signals with a prescribed spectrum
• Necessary and sufficient conditions for the two-point phase probability function of two-phase random media

This page was built for publication: Characterizing the autocorrelations of binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4746694)