Please use this identifier to cite or link to this item:
Title: The field descent method
Authors: Bernhard, Schmidt.
Ka, Hin Leung.
Keywords: DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics
Issue Date: 2005
Source: Bernhard, S., & Ka, H. L. (2005). The field descent method. Journal of designs codes and cryptography, 36(2), 171-188.
Series/Report no.: Journal of designs codes and cryptography
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<v<548, 964, 900 and no Barker sequence of length l with 13 < l < 10^22.
ISSN: 0925-1022
DOI: 10.1007/s10623-004-1703-7
Rights: Designs, codes and cryptography © copyright 2005 Springer Netherlands. The journal's website is located at
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
25.pdfAccepted version263.38 kBAdobe PDFThumbnail

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.