# Constructions of Hadamard Difference Sets

@article{Wilson1997ConstructionsOH,
author={Richard M. Wilson and Qing Xiang},
journal={J. Comb. Theory, Ser. A},
year={1997},
volume={77},
pages={148-160}
}
• Published 1997
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
Using a spread ofPG(3, p) and certain projective two-weight codes, we give a general construction of Hadamard difference sets in groupsH×(Zp)4, whereHis either the Klein 4-group or the cyclic group of order 4, andpis an odd prime. In the casep?3 (mod 4), we use an ovoidal fibration ofPG(3, p) to construct Hadamard difference sets, this construction includes Xia's construction of Hadamard difference sets as a special case. In the casep?1 (mod 4), we construct new reversible Hadamard difference… Expand
26 Citations

#### Topics from this paper

On the Existence of Abelian Hadamard Difference Sets and a New Family of Difference Sets
We present a construction of Hadamard difference sets in abelian groups of order 4p4n, whose Sylowp-subgroups are elementary. By a standard composition procedure, we can now conclude that (4h2,Expand
Generalized constructions of Menon-Hadamard difference sets
• Mathematics, Computer Science
• Finite Fields Their Appl.
• 2020
This paper gives a new construction of spreads and projective sets of type Q in ${\mathrm{PG}}(3,q)$ for all odd prime powers $q$, which generalizes the examples found by Wilson and Xiang and solves a problem left open in Section 5 of the Wilson-Xiang paper from 1997. Expand
Paley partial difference sets in groups of order n4 and 9n4 for any odd n>1
A recursive theorem is given that for all odd n>1 constructs Paley partial difference sets in certain groups of order n^4 and 9n^4. Expand
A Unifying Construction for Difference Sets
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 1997
We present a recursive construction for difference sets which unifies the Hadamard, McFarland, and Spence parameter families and deals with all abelian groups known to contain such difference sets.Expand
Linear Codes and the Existence of a Reversible Hadamard Difference Set in Z2xZ2xZ45
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 1997
Applying the Turyn composition theorem, one obtains abelian difference sets and Hadamard matrices of Williamson type of order 4×54n×p4n11×?× p4nttwheren, n1, ?, ntare arbitrary non-negative integers and eachpiis a prime,pi?3 (mod 4). Expand
Building Symmetric Designs With Building Sets
• Yury J. Ionin
• Mathematics, Computer Science
• Des. Codes Cryptogr.
• 1999
We introduce a uniform technique for constructing a family of symmetric designs with parameters (v(qm+1-1)/(q-1), kqm,λqm), where m is any positive integer, (v, k, λ) are parameters of an abelianExpand
Paley type partial difference sets in non p-groups
Two infinite families of negative Latin square type partial difference sets in groups of the form of the Stanton-Sprott family are constructed, which provides new constructions of Hadamard matrices and implies the existence of many new strongly regular graphs including some that are conference graphs. Expand
A New Method for Constructing Williamson Matrices
• Mathematics, Computer Science
• Des. Codes Cryptogr.
• 2005
For every prime power q ≡ 1 (mod 4) we prove the existence of (q; x, y)-partitions of GF(q) with q=x2+4y2 for some x, y, which are very useful for constructing SDS, DS and Hadamard matrices. WeExpand
A Unified Approach to Difference Sets with gcd(V,N) > 1
• Mathematics
• 1999
The five known families of difference sets whose parameters (v, k, λ; n) satisfy the condition gcd(v, n) > 1 are the McFarland, Spence, Davis-Jedwab, Hadamard and Chen families. We survey recent workExpand
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 2020
A number of new infinite families of Hadamard matrices of order 4(uv+1) are obtained by applying the Wallis-Whiteman array or the Kharaghani array to the difference families constructed. Expand

#### References

SHOWING 1-10 OF 13 REFERENCES
A survey of partial difference sets
• S. L. Ma
• Mathematics, Computer Science
• Des. Codes Cryptogr.
• 1994
In this survey, it is tried to list all important existence and nonexistence results concerning partial difference sets, e.g., constructions using partial congruence partitions, quadratic forms, cyclotomic classes and finite local rings. Expand
• Ken W. Smith
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 1995
This example gives rise to an infinite family of non-abelian difference sets with parameters, where t = 2 q · 3 r · 5 · 10 s, q, r, s ⩾ 0, and r > 0 ⇒ q > 0. Expand
Some Infinite Classes of Special Williamson Matrices and Difference Sets
• Ming-Yuan Xia
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 1992
There exist Hadamard matrices of special Williamson kind and difference sets of order 4 × 32r × (p1r1···pnrn)4 for any integer n ⩾ 1, primes p1, …, pn, and all nonnegative integers r, r1,…, rn. Expand
On Xia's Construction of Hadamard Difference Sets
• Mathematics
• 1996
In this paper, we present a new way of viewing Xia's construction of Hadamard difference sets. Based on this new point of view, we give a character theoretic proof for Xia's construction. Also weExpand
An Infinite Class of Williamson Matrices
• R. Turyn
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 1972
An infinite family is constructed here, and as a corollary it is shown that an Hadamard matrix of order 6( q + 1) exists if q is a prime power ≡ 1 (mod 4). Expand
Construction of two-dimensional flag-transitive planes
• Mathematics
• 1988
An affine plane is called flag-transitive if it admits a collineation group which acts transitively on the incident point-line pairs. It has been shown that finite flag-transitive planes areExpand
A Special Class of Williamson Matrices and Difference Sets
• R. Turyn
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 1984
A construction is given of a very special class of Hadamard matrices of the Williamson kind and difference sets of order 4 · 32m. Expand
The Geometry of Two‐Weight Codes
• Mathematics
• 1986
On etudie les relations entre les codes [n,k] lineaires a deux poids, les ensembles (n,k,h 1 h 2 ) projectifs et certains graphes fortement reguliers
Partitioning projective geometries into caps, Canad
• J. Math. 37, No
• 1988
A course in combinatorics
• Computer Science
• 1992