A coding theoretic solution to the 36 officer problem

DOI10.1007/BF01578866zbMath0796.05012OpenAlexW2028126680MaRDI QIDQ1321562

Steven T. Dougherty

Publication date: 5 September 1994

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01578866

zbMATH Keywords

36 officer problemEuler conjecture

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (6)

A candidate for the ``Next Fermat Problem ⋮ Maximal sets of mutually orthogonal frequency squares ⋮ A short disproof of Euler's conjecture based on quasi-difference matrices and difference matrices ⋮ Pairs of MOLS of order ten satisfying non-trivial relations ⋮ Group divisible designs in MOLS of order ten ⋮ Mutually orthogonal binary frequency squares

Cites Work

• A short proof of the nonexistence of a pair of orthogonal Latin squares of order six
• On the construction of finite projective planes from homology semibiplanes
• Affine and projective planes
• Bruck nets, codes, and characters of loops
• Nets and their codes
• Finite Nets, I. Numerical Invariants

This page was built for publication: A coding theoretic solution to the 36 officer problem