The combinatorics of binary arrays (Q1365504): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:05, 5 March 2024

scientific article
Language Label Description Also known as
English
The combinatorics of binary arrays
scientific article

    Statements

    The combinatorics of binary arrays (English)
    0 references
    0 references
    15 January 1998
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    binary arrays
    0 references
    autocorrelation
    0 references
    difference sets
    0 references
    de Bruijn sequences
    0 references