György E. Révész
Theoretical Computer Science
Inspection of optimum Golomb squares found by exhaustive computer search shows some are symmetric with respect to diagonal reflection. This suggests searching for such symmetric Golomb squares might be an efficient way to find good squares. In this correspondence, we find the best symmetric N × N Golomb squares for N ≤ 22. Some appear to be the best known. © 2004 IEEE.
György E. Révész
Theoretical Computer Science
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001