Show simple item record

dc.contributor.authorNgaii, John W
dc.contributor.authorManene, Moses
dc.contributor.authorNjui, Francis
dc.date.accessioned2023-07-04T09:20:00Z
dc.date.available2023-07-04T09:20:00Z
dc.date.issued2020
dc.identifier.urihttp://dx.doi.org/10.17654/TS059010001
dc.identifier.urihttps://repository.kcau.ac.ke/handle/123456789/1401
dc.description.abstractThe relation between balanced arrays and two other combinatorial structures, namely, orthogonal arrays and transitive arrays is pointed out. We provide three new and simple but rather stringent methods of constructing balanced arrays of any strength provided that the balanced arrays exist. A theorem that enables one to generate a balanced array from several known balanced arrays has been proved. The existence results of some types of balanced arrays based on the existence of some types of Hadamard matrices have also been proved.en_US
dc.language.isoenen_US
dc.publisherFar East Journal of Theoretical Statisticsen_US
dc.subjectbalanced arrays, orthogonal arrays, transitive arrays, Hadamard matrices, combinatorial structures, strength of an array.en_US
dc.titleFurther Construction Of Balanced Arraysen_US
dc.typeArticleen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record