Autocorrelation via Runs

DOI10.1007/978-3-319-99957-9_13MaRDI QIDQ6108825zbMATH OpenOpenAlexFDO

Authors Ilias S. Kotsireas, Jing Yang

Publication date 30 June 2023

Published in Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99957-9_13

zbMATH Keywords

D-optimal designHadamard matrixperiodic autocorrelation functionsupplementary difference set

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Optimal statistical designs (62K05) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Algorithms on strings (68W32)

Recommendations

• Autocorrelations of Binary Sequences and Run Structure
• The relation between autocorrelation and run-length of binary sequences
• Autocorrelation functions
• Analysis of Autocorrelations in Dynamic Processes
• Study of average run lengths for supplementary runs rules in the presence of autocorrelation
• Autocorrelation and the sum of stochastic variables
• On average run lengths of control charts for autocorrelated processes

Cites work

• Compression of periodic complementary sequences and applications
• Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices)
• General lower bounds on maximal determinants of binary matrices
• On minors of maximal determinant matrices
• On the enumeration of some D-optimal designs

Cited in

(3)

• The relation between autocorrelation and run-length of binary sequences
• On SPC for Short Run Autocorrelated Data
• k-autocorrelation and its applications

This page was built for publication: Autocorrelation via Runs

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