A coding theoretic solution to the 36 officer problem
From MaRDI portal
Publication:1321562
DOI10.1007/BF01578866zbMath0796.05012OpenAlexW2028126680MaRDI QIDQ1321562
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
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
This page was built for publication: A coding theoretic solution to the 36 officer problem