Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Rely To "Comment On 'Nonexistence Of Certain Perfect Binary Arrays' And 'Nonexistence Of Perfect Binary Arrays'", Jonathan Jedwab, James A. Davis
Rely To "Comment On 'Nonexistence Of Certain Perfect Binary Arrays' And 'Nonexistence Of Perfect Binary Arrays'", Jonathan Jedwab, James A. Davis
Department of Math & Statistics Faculty Publications
Yang's comment [C] is based on a lemma which claims to construct an s0 x s1 x s2 x ... x s, perfect binary array (PBA) from an s0s1 x s2 x ... x sr PBA.
Nonexistence Of Certain Perfect Binary Arrays, Jonathan Jedwab, James A. Davis
Nonexistence Of Certain Perfect Binary Arrays, Jonathan Jedwab, James A. Davis
Department of Math & Statistics Faculty Publications
A perfect binary array (PBA) is an r-dimensional matrix with elements ±I such that all out-of-phase periodic autocorrelation coefficients are zero. The two smallest sizes for which the existence of a PBA is undecided, 2 x 2 x 3 x 3 x 9 and 4 x 3 x 3 x 9, are ruled out using computer search and a combinatorial argument.
A Summary Of Menon Difference Sets, James A. Davis, Jonathan Jedwab
A Summary Of Menon Difference Sets, James A. Davis, Jonathan Jedwab
Department of Math & Statistics Faculty Publications
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d1d2-1 : d1,d2 ∈ D, d1 ≠ d2} contains each nonidentity element of G exactly λ times. A difference set is called abelian, nonabelian or cyclic if the underlying group is. Difference sets a.re important in design theory because they a.re equivalent to symmetric (v, k, λ) designs with a regular automorphism group. Abelian difference sets arise naturally in …