Infinite families of perfect binary arrays
Peter Wild
Abstract
Peter Wild
Abstract
We construct four infinite families of perfect binary arrays. Jedwab and Mitchell have constructed some small perfect binary arrays using quasiperfect binary arrays and doubly quasiperfect binary arrays. We show that a doubly quasiperfect binary array is equivalent to a quasiperfect binary array. This means Jedwab and Mitchell's construction can be iterated to obtain larger perfect binary arrays.
OpenAlex reports 56 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We construct four infinite families of perfect binary arrays. Jedwab and Mitchell have constructed some small perfect binary arrays using quasiperfect binary arrays and doubly quasiperfect binary arrays. We show that a doubly quasiperfect binary array is equivalent to a quasiperfect binary array. This means Jedwab and Mitchell's construction can be iterated to obtain larger perfect binary arrays.
Key concepts: Binary number, Construct (python library), Iterated function, Binary Independence Model, Algorithm, Binary data, Mathematics, Computer science