1997
DOI: 10.1016/s0378-3758(97)84208-5
|View full text |Cite
|
Sign up to set email alerts
|

The combinatorics of binary arrays

Abstract: This paper gives an account of the combinatorics of binary arrays, mainly concerning their randomness properties. In many cases the problem reduces to the investigation on difference sets.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 81 publications
(72 reference statements)
0
1
0
Order By: Relevance
“…Special case when r = m = 1 (or s = n = 1) in M-array [33]. m-array As M-array, but rs = 2 mn − 1, except zero matrix [33].…”
Section: De Bruijnmentioning
confidence: 99%
“…Special case when r = m = 1 (or s = n = 1) in M-array [33]. m-array As M-array, but rs = 2 mn − 1, except zero matrix [33].…”
Section: De Bruijnmentioning
confidence: 99%