Abstract
Using the tools of algebraic coding theory, we give a new proof of the nonexistence of two mutually orthogonal Latin squares of order 6.
Similar content being viewed by others
References
E.F. Assmus, Jr. and J.D. Key, Affine and projective planes,Discrete Math Vol. 83 (1990), pp. 161–187.
R.H. Bruck, Finite Nets I. Numerical invariants,Can. J. Math. 3 (1951), pp. 94–107.
S.T. Dougherty, Nets and their codes, Ph.D. thesis. Lehigh University (1992).
L. Euler, Recherches sur une nouvelle espece des quarres magiques.,Leonardi Euleri Opera Omina Ser. I, Vol. 7, Tuebner, Berlin-Leipzig, (1923), pp. 291–392.
R.A. Fisher and F. Yates, The 6×6 Latin squares,Proc. Camb. Phil. Soc. 30 (1934), pp. 492–507.
G.E. Moorhouse, Bruck nets, codes, and characters of loops,Designs, Codes and Cryptography Vol 1 (1991), pp. 7–29.
G.E. Moorhouse, On codes of Bruck nets and projective planes,Proc. Marshall Hall Conf. (1990).
D.R. Stinson, A short proof of the non-existence of a pair of orthogonal Latin squares of order six,J. Comb. Theory A36 (1984), pp. 373–376.
G. Tarry, Le probleme des 36 officers,Compte Rendu Ass. Franc. Pour l'avacement des Sciences Vol. 2 (1901), pp. 170–203.
Author information
Authors and Affiliations
Additional information
Communicated by D. Jungnickel
Rights and permissions
About this article
Cite this article
Dougherty, S.T. A coding theoretic solution to the 36 officer problem. Des Codes Crypt 4, 123–128 (1994). https://doi.org/10.1007/BF01578866
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01578866