Perfect Latin squares (Q1199432)

The present authors introduced a new type of latin squares which they called perfect latin squares. Perfect latin squares were defined by the authors as special diagonal latin squares. \textit{E. Gergely} showed a general method to construct diagonal latin squares of any order \(n\geq 4\), see J. Comb. Theory, Ser. A 16, 266--272 (1974; Zbl 0272.05015). The present authors pointed out that for all \(n\), there exists a perfect latin square of order \(n^ 2\). In this paper the authors, using perfect latin squares, solved a class of parallel array access problems. Reviewer's remark: It is worth to mention (unfortunately it is not included in the paper) that the first author in a joint paper with \textit{C. J. Colbourn} [J. Parallel Distrib. Comput. 14, 193--200 (1992), \url{doi:10.1016/0743-7315(92)90116-5}] used latin squares as tools in the design of conflict free access of parallel memories.