Please use this identifier to cite or link to this item:
|Title:||The field descent method|
|Authors:||Leung, K.H. |
|Source:||Leung, K.H., Schmidt, B. (2005-08). The field descent method. Designs, Codes, and Cryptography 36 (2) : 171-188. ScholarBank@NUS Repository. https://doi.org/10.1007/s10623-004-1703-7|
|Abstract:||We obtain a broadly applicable decomposition of group ring elements into a "subfield part" and a "kernel part". Applications include the verification of Lander's conjecture for all difference sets whose order is a power of a prime >3 and for all McFarland, Spence and Chen/Davis/Jedwab difference sets. We obtain a new general exponent bound for difference sets. We show that there is no circulant Hadamard matrix of order v with 4|
|Source Title:||Designs, Codes, and Cryptography|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 28, 2018
WEB OF SCIENCETM
checked on Feb 19, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.