Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Construction of a Class of Orthogonal Arrays (Thesis)

Published 25 Oct 2012 in cs.DM and math.CO | (1210.6923v1)

Abstract: We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The effectiveness of the proposed algorithm lies in the fact that it works well with any linear seed orthogonal array without imposing any constraints on the strength or the number of levels. The resulting orthogonal array has the same strength as the seed orthogonal array. We also discuss the proof of correctness of the algorithm. In the Results section we provide a list of new orthogonal arrays generated using this algorithm, that are currently not present in the libraries of orthogonal arrays.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.