Generating generalized cyclic designs with factorial balance

Abstract

An algorithm for generating paired comparison factorially balanced generalized cyclic designs is described. The algorithm is based upon the 2 ⁿ − 1 class association scheme defined by Shah (1960) for n-factor experiments. The algorithm is highly successful in achieving its objective. Firstorder designs with block size greater than two can also be obtained using the algorithm.

Keywords:

• Paried comparison design
• binary number association scheme
• eigenvalue
• generalized cyclic design
• PBIB design
• first-order design