Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine