Please use this identifier to cite or link to this item:
|Title:||Kronecker sum of binary orthogonal Arrays|
|Publisher:||UTIL MATH PUBL INC|
|Citation:||UTILITAS MATHEMATICA, 75(), 249-257|
|Abstract:||Kronecker sum of binary orthogonal arrays have been introduced. It is well known that for any t >= 2, OA(2(t) t + 1, 2, t) exists. We give conditions under which OA(2(t), t+ 1, 2, t) is self-conjugate, and show the existence of mixed OA(2(t), n x 2(t+1), 2). Also, we prove that the existence of OA(N, k, 2, t'), t' >= 2, implies the existence of OA(N2(t), k(t + 1), 2, p), which is a-resolvable, and obtain mixed OA(N2(t), n x 2(4k(t+1)), p) therefrom, where p = 2 if max(t, t') = 2, and p = 3 if max(t, t') >= 3, where t corresponds to the trivial OA(2(t), t + 1, 2, t).|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.