Skip to main content
Log in

A coding theoretic solution to the 36 officer problem

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E.F. Assmus, Jr. and J.D. Key, Affine and projective planes,Discrete Math Vol. 83 (1990), pp. 161–187.

    Google Scholar 

  2. R.H. Bruck, Finite Nets I. Numerical invariants,Can. J. Math. 3 (1951), pp. 94–107.

    Google Scholar 

  3. S.T. Dougherty, Nets and their codes, Ph.D. thesis. Lehigh University (1992).

  4. 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.

    Google Scholar 

  5. R.A. Fisher and F. Yates, The 6×6 Latin squares,Proc. Camb. Phil. Soc. 30 (1934), pp. 492–507.

    Google Scholar 

  6. G.E. Moorhouse, Bruck nets, codes, and characters of loops,Designs, Codes and Cryptography Vol 1 (1991), pp. 7–29.

    Google Scholar 

  7. G.E. Moorhouse, On codes of Bruck nets and projective planes,Proc. Marshall Hall Conf. (1990).

  8. 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.

    Google Scholar 

  9. G. Tarry, Le probleme des 36 officers,Compte Rendu Ass. Franc. Pour l'avacement des Sciences Vol. 2 (1901), pp. 170–203.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by D. Jungnickel

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01578866

Keywords

Navigation