Williamson matrices up to order 59
نویسندگان
چکیده
A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this paper a new algorithm is introduced to search for hard to find Williamson matrices. We find all nonequivalent Williamson matrices of odd order n up to n = 59. It turns out that there are none for n = 35, 47, 53, 59 and it seems that the Turyn class may be the only infinite class of these matrices. AMS Subject Classification: 05B20.
منابع مشابه
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture
We employ tools from the fields of symbolic computation and satisfiability checking— namely, computer algebra systems and SAT solvers—to study the Williamson conjecture from combinatorial design theory and increase the bounds to which Williamson matrices have been enumerated. In particular, we completely enumerate all Williamson matrices of even order up to and including 70 which gives us deepe...
متن کاملA new construction for Williamson-type matrices
It is shown that if q is a prime power then there are Williamson-type matrices of order (i) 1/2q2(q + 1) when q ≡ 1 (mod 4), (ii)1/4q2(q + 1) when q ≡ 3 (mod 4) and there are Williamson-type matrices of order l/4(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an H...
متن کاملSome infinite classes of Williamson matrices and weighing matrices
Williamson type matrices A, B, C 1 D will be called nice if ABT + C DT = 0, perfect if ABT + CDT = ACT + BDT 0, special if ABT + CDT = ACT + BDT = ADT + BCT = o. Type 1 (1 , -1 )-matrices A, B, C, D of order n will be called tight Williamson-like matrices if AAT + BBT + CCT + DDT 4nIn and ABT + BAT + CDT + DCT o. Write N = 32T . piTl ••• p!Tn , where Pj 3(mod 4), Pj > 3, j = 1, ... ,n and r, rl...
متن کاملThe Quaternary Complex Hadamard Conjecture of order 2 n
ABSTRACT: In this paper, a complete construction of quaternary complex Hadamard matrices of order 2 n is obtained using the method of Sylvester construction and Williamson construction. Williamson construction has been generalized to obtain any kind of Hadamard matrices (Complex or Real Numbers). Non-equivalent family of Hadamard Matrices can be obtained using the Generalized Williamson constru...
متن کاملRegular sets of matrices and applications
Suppose A 1 ; ; A s are (1;?1) matrices of order m satisfying (4) Call A 1 ; ;A s a regular s-set of matrices of order m if (1), (2), (3) are satissed and a regular s-set of regular matrices if (4) is also satissed, these matrices were rst discovered by J. Seberry and A. L. Whiteman in \New Hadamard matrices and conference matrices obtained via Mathon's construction", Graphs and Combinatorics, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 46 شماره
صفحات -
تاریخ انتشار 2008