The Hadamard maximal determinant problem seeks an $n\times n$ matrix $X$ with entries in $\{\pm 1\}$, which maximizes the determinant $\vert \det X \vert$ for a given order $n \in \mathbb{N}$. We report matrices attaining new record determinants for orders $n\equiv 3\pmod{4}$ between $103$ and $119$, as well as $n=51$. We provide a proof of optimality within a specific family of circulant--block constructions for $X$. For these orders, we recast the Hadamard problem as a sequence reconstruction problem from a pair of periodic autocorrelation functions, subject to certain arithmetic conditions. We describe several learning--based strategies for reconstruction and provide a comparison with classical simulated annealing--style approaches as a benchmark.

翻译：暂无翻译