The combinatorics of binary arrays

DOI10.1016/S0378-3758(97)84208-5MaRDI QIDQ1365504zbMATH OpenFDO

Publication date 15 January 1998

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10722/48601

autocorrelation binary arrays de Bruijn sequences difference sets

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite fields (field-theoretic aspects) (12E20) Combinatorics on words (68R15)

Review text

This paper is a summary of a survey on (periodical binary) \(r\times s\) arrays, that is on infinite matrices \(A=\{a_{ij}\}\) (\(a_{ij}\in \{0,1\}\); \(i,j\) integers) such that \(a_{ij}=a_{i+r,s}=a_{i,j+s}\), for all \(i\) and \(j\). As generalisation of de Bruijn sequences is treated the possibility to have an \(r\times s\) array with \(rs=2^{mn}\) in which all \(m\times n\) subarrays are different. Certain autocorrelation functions for \(A\) give problems equivalent to questions on (relative or not) difference sets and planar functions and so lead for example to the projective plane conjecture. Other analogous functions lead for example to SONAR arrays, the Goulomb conjecture and Barker sequences. Obviously the paper can only point out some links and some (updated) references.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: The combinatorics of binary arrays

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