A construction method for generalized Room squares

Abstract

A Generalized Room Square (GRS) of ordern and degreek is an$\left( {\begin{array}{*{20}c} {n - 1} \\ {k - 1} \\ \end{array} } \right) \times \left( {\begin{array}{*{20}c} {n - 1} \\ {k - 1} \\ \end{array} } \right)$ array of which each cell is either empty or contains an unorderedk-tuple of a setS, |S|=n, such that each row and each column of the array contains each element ofS exactly once and the array contains each unorderedk-tuple exactly once. A method of generating the unordered triples on the setS=GF(q) ⋃ {∞} is given, 3 ∣ (q ∣ 1). This method is used to construct GRS's of appropriate ordern and degree 3, for alln<50.