Perfect binary arrays and difference sets

Citations of this article
Mendeley users who have this article in their library.
Get full text


A perfect binary array is an r-dimensional array with elements ± 1 such that all out-of-phase periodic autocorrelation coefficients are zero. Such an array is equivalent to a Menon difference set in an abelian group. We give recursive constructions for four infinite families of two-dimensional perfect binary arrays, using only elementary methods. Brief outlines of the proofs were previously given by three of the authors. Although perfect binary arrays of the same sizes as two of the families were constructed earlier by Davis, the sizes of the other two families are new. © 1994.




Jedwab, J., Mitchell, C., Piper, F., & Wild, P. (1994). Perfect binary arrays and difference sets. Discrete Mathematics, 125(1–3), 241–254.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free