A construction method for Hadamard matrices using finite differences (Kirk McMullan, CofC)

Abstract: We prove that a (2k+1,k,k-1) 2-set difference family (k greater or equal 2) implies the existence of an nxn Hadamard matrix, where n=4(k+1). A quick computer search has found such difference families for k=2, ... , 13, giving hope for a unified method of constructing Hadamard matrices.

---

This is an abstract of a poster to be presented at the 2004 SEAMS Workshop in Charleston, SC. For more information, visit the workshop's homepage at math.cofc.edu/SEAMS.