Generalized constructions of Menon-Hadamard difference sets
Koji Momihara, Qing Xiang

TL;DR
This paper broadens the methods for constructing Menon-Hadamard difference sets by generalizing previous frameworks, introducing flexible constructions using cyclotomic classes and solving an open problem from 1997.
Contribution
It generalizes Chen's construction with semi-primitive cyclotomic classes and provides a new, more flexible construction of spreads and projective sets of type Q in PG(3,q).
Findings
Demonstrates greater flexibility in constructing projective sets of type Q.
Provides a new construction of spreads and projective sets for all odd prime powers q.
Solves an open problem from Wilson-Xiang 1997.
Abstract
We revisit the problem of constructing Menon-Hadamard difference sets. In 1997, Wilson and Xiang gave a general framework for constructing Menon-Hadamard difference sets by using a combination of a spread and four projective sets of type Q in . They also found examples of suitable spreads and projective sets of type Q for . Subsequently, Chen (1997) succeeded in finding a spread and four projective sets of type Q in satisfying the conditions in the Wilson-Xiang construction for all odd prime powers . Thus, he showed that there exists a Menon-Hadamard difference set of order for all odd prime powers . However, the projective sets of type Q found by Chen have automorphisms different from those of the examples constructed by Wilson and Xiang. In this paper, we first generalize Chen's construction of projective sets of type Q…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Finite Group Theory Research
Generalized constructions of Menon-Hadamard difference sets
Koji Momihara*†* and Qing Xiang*∗*
Faculty of Education, Kumamoto University, 2-40-1 Kurokami, Kumamoto 860-8555, Japan
Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA
Abstract.
We revisit the problem of constructing Menon-Hadamard difference sets. In 1997, Wilson and Xiang gave a general framework for constructing Menon-Hadamard difference sets by using a combination of a spread and four projective sets of type Q in . They also found examples of suitable spreads and projective sets of type Q for . Subsequently, Chen (1997) succeeded in finding a spread and four projective sets of type Q in satisfying the conditions in the Wilson-Xiang construction for all odd prime powers . Thus, he showed that there exists a Menon-Hadamard difference set of order for all odd prime powers . However, the projective sets of type Q found by Chen have automorphisms different from those of the examples constructed by Wilson and Xiang. In this paper, we first generalize Chen’s construction of projective sets of type Q by using “semi-primitive” cyclotomic classes. This demonstrates that the construction of projective sets of type Q satisfying the conditions in the Wilson-Xiang construction is much more flexible than originally thought. Secondly, we give a new construction of spreads and projective sets of type Q in for all odd prime powers , which generalizes the examples found by Wilson and Xiang. This solves a problem left open in Section 5 of the Wilson-Xiang paper from 1997.
Key words and phrases:
Gauss sum, Menon-Hadamard difference set, projective set of type Q, spread
† Koji Momihara was supported by JSPS under Grant-in-Aid for Young Scientists (B) 17K14236 and Scientific Research (B) 15H03636.
∗ Qing Xiang was supported by an NSF grant DMS-1600850.
1. Introduction
Let be an additively written abelian group of order . A -subset of is called a * difference set* if the list of differences “, ”, represents each nonidentity element of exactly times. In this paper, we revisit the problem of constructing Menon-Hadamard difference sets, namely those difference sets with parameters , where is a positive integer. It is well known that a Menon-Hadamard difference set generates a regular Hadamard matrix of order . So by contructing Menon-Hadamard difference sets in groups of order , we obtain regular Hadamard matrices of order .
The main problem in the study of Menon-Hadamard difference sets is: For each positive integer , which groups of order contain a Menon-Hadamard difference set. We give a brief survey of results on this problem in the case where the group under consideration is abelian. First we mention a product theorem of Turyn [11]: If there are Menon-Hadamard difference sets in abelian groups and , respectively, where and , , are squares, then there also exists a Menon-Hadamard difference set in . With Turyn’s product theorem in hand, in order to construct Menon-Hadamard difference sets, one should start with the case where the order of the abelian group is with an even power of a prime. In the case where is an even power of , that is, is an abelian -group, the existence problem was completely solved in [8] after much work was done in [5]; it was shown that there exists a Menon-Hadamard difference set in an abelian group of order if and only if the exponent of is less than or equal to .
In the case where is an even power of an odd prime, Turyn [11] observed that there exists a Menon-Hadamard difference set in ; hence by the product theorem, there is a Menon-Hadamard difference set in for any positive integer . On the other hand, McFarland [10] proved that if an abelian group of order , where is a prime, contains a Menon-Hadamard difference set, then or . After McFarland’s paper [10] was published, it was conjectured [7, p. 287] that if an abelian group of order contains a Menon-Hadamard difference set, then for some nonnegative integers and . So it was a great surprise when Xia [13] constructed a Menon-Hadamard difference set in for any odd prime congruent to modulo . Xia’s method of contruction depends on very complicated computations involving cyclotomic classes of finite fields; it was later simplified by Xiang and Chen [14] by using a character theoretic approach. Moreover, in [14], the authors also asked whether a certain family of 3-weight projective linear code exists or not, since such projective linear codes are needed for the construction of Menon-Hadamard difference set in the group , where is a prime congruent to 1 modulo 4.
Van Eupen and Tonchev [6] found the required 3-weight projective linear codes when , hence constructed Menon-Hadamard difference sets in , which are the first examples of abelian Menon-Hadamard difference sets in groups of order , where is a prime congruent to modulo . Inspired by these examples, Wilson and Xiang [12] gave a general framework for constructing Menon-Hadamard difference sets in the groups , where is either group of order and is an elementary abelian group of order , an odd prime power, using a combination of a spread and four projective sets of type Q in . (See Section 2.2 for the definition of projective sets of type Q.) Wilson and Xiang [12] also found examples of suitable spreads and the required projective sets of type Q when . They used as a model of the four-dimensional vector space over , and considered projective sets of type Q with the automorphism
[TABLE]
where is a primitive element of . However, the existence of the required projective sets of type Q with this prescribed automorphism remained unsolved for .
Immediately after [12] appeared, Chen [4] succeeded in showing the existence of a combination of a spread and four projective sets of type Q in satisfying the conditions in the Wilson-Xiang construction for all odd prime powers . As a consequence, Chen [4] obtained the following theorem by applying Turyn’s product theorem in [11].
Theorem 1.1**.**
Let , , be odd primes and , , be positive integers. Furthermore, let be either group of order and , , be an elementary abelian group of order . Then, there exists a Menon-Hadamard difference set in .
Here, Chen [4] found projective sets of type Q in with the following automorphism
[TABLE]
which is obviously different from that of the projective sets of type Q found by Wilson and Xiang [12]. Thus, the existence problem of projective sets of type Q in with the prescribed automorphism remained open.
The objectives of this paper are two-fold. First, we give a generalization of Chen’s construction of projective sets of type Q by using “semi-primitive” cyclotomic classes. This demonstrates that the construction of projective sets of type Q satisfying the conditions in the Wilson-Xiang construction is much more flexible than originally thought. In particular, the proof of the candidate sets are projective sets of type Q is much simpler than that in [4]. Second, we show the existence of a combination of a spread and four projective sets of type Q with automorphism for all odd prime powers . Our construction generalizes the examples found by Wilson and Xiang in [12]; this solves the problem left open in Section 5 of [12].
2. Preliminaries
2.1. Characters of finite fields
In this subsection, we collect some auxiliary results on characters of finite fields. We assume that the reader is familiar with basic theory of characters of finite fields as in [9, Chapter 5].
Let be a prime and be positive integers. We set , and denote the finite field of order by . Let be the trace map from to , which is defined by
[TABLE]
Let be a fixed primitive element of , a fixed (complex) primitive th root of unity, and a (complex) th root of unity. The character of the additive group of defined by , , is called the canonical additive character of . Then, each additive character is given by , , where . On the other hand, each multiplicative character is given by , , where .
For a multiplicative character of , the character sum defined by
[TABLE]
is called a Gauss sum of . Gauss sums satisfy the following basic properties: (1) if is nontrivial; (2) ; (3) if is trivial.
In general, explicit evaluations of Gauss sums are difficult. There are only a few cases that the Gauss sums have been completely evaluated. The most well-known case is the quadratic case, i.e., the order of the multiplicative character involved is .
Theorem 2.1**.**
([9, Theorem 5.15])* Let be the quadratic character of . Then,*
[TABLE]
The next simple case is the so-called semi-primitive case, where there exists an integer such that . Here, is the order of the multiplicative character involved. In particular, we give the following for later use.
Theorem 2.2**.**
([9, Theorem 5.16])* Let be a nontrivial multiplicative character of of order dividing . Then,*
[TABLE]
We will also need the Davenport-Hasse product formula, which is stated below.
Theorem 2.3**.**
([2, Theorem 11.3.5])* Let be a multiplicative character of order of . For every nontrivial multiplicative character of ,*
[TABLE]
Let be a positive integer dividing . We set , , which are called the th cyclotomic classes of . In this paper, we need to evaluate the (additive) character values of a union of some cyclotomic classes. In particular, the character sums defined by
[TABLE]
are called the th Gauss periods of . By the orthogonality of characters, the Gauss period can be expressed as a linear combination of Gauss sums:
[TABLE]
where is any fixed multiplicative character of order of . For example, if , we have the following from Theorem 2.1:
[TABLE]
where is the quadratic character of . On the other hand, the Gauss sum with respect to a multiplicative character of order can be expressed as a linear combination of Gauss periods:
[TABLE]
2.2. Known results on projective sets of type Q
Let denote the -dimensional projective space over . A set of points of is called a projective set if every hyperplane of meets in or points. In particular, a subset of the point set of is called type Q if
[TABLE]
In this paper, we will use the following model of : We view as a -dimensional vector space over . For a nonzero vector , we use to denote the projective point in corresponding to the one-dimensional subspace over spanned by . Let be the set of points of . Then, all (hyper)planes in are given by
[TABLE]
Let be a set of points of , and define
[TABLE]
Noting that each nontrivial additive character of is given by
[TABLE]
where , we have
[TABLE]
Hence, we have the following proposition.
Proposition 2.4**.**
The set is a projective set of type Q in if and only if and take exactly two values and for all .
The set is also called type Q if it satisfies the condition of Proposition 2.4.
A spread in is a collection of pairwise skew lines; equivalently, can be regarded as a collection of -dimensional subspaces of the underlying -dimensional vector space over , any two of which intersect at zero only. We also call such a set of -dimensional subspaces as a spread of .
The following important theorem was given by Wilson and Xiang [12].
Theorem 2.5**.**
Let be a spread of , and assume the existence of four pairwise disjoint projective sets , , of type Q in such that and . Then there exists a Menon-Hadamard difference set in , where is either group of order and is an elementary abelian group of order .
Remark 2.6**.**
From Proposition 2.4 and Theorem 2.5, in order to construct a Menon-Hadamard difference set in a group of order , we need to find four disjoint sets , , of type Q and a suitable spread consisting of -dimensional subspaces of such that and .
We now review the construction of projective sets of type Q given by Chen [4]. Let be a primitive element of . Furthermore, let
[TABLE]
Define
[TABLE]
and
[TABLE]
where or depending on whether or . It is clear that these type Q sets admit the automorphism .
Theorem 2.7**.**
The sets , , are type Q. Furthermore, these sets satisfy the assumption of Remark 2.6 with respect to the spread consisting of the following -dimensional subspaces:
[TABLE]
On the other hand, Wilson and Xiang [12] constructed Menon-Hadamard difference sets of order for using the following four type Q sets:
[TABLE]
for some subsets , , of , and the spread consisting of the following -dimensional subspaces:
[TABLE]
It is clear that these type Q sets admit the automorphism .
3. A generalization of Chen’s construction
We first fix notation used in this section. Let be an odd prime power with a prime, and be a fixed positive integer satisfying . Then, there exists a minimal such that . Write for some . Let be a primitive element of . Let , , be two arbitrary subsets of , and
[TABLE]
Furthermore, let be any -subset of such that . Define
[TABLE]
and
[TABLE]
Remark 3.1**.**
- (i)
The indicator function of , , is given by
[TABLE]
- (ii)
The size of each is since is a linear mapping over .
- (iii)
The size of is ; it is clear that
[TABLE]
Since , if and only if . Hence, the right-hand side of (3.3) is equal to .
- (iv)
Since , the character values of , , can be evaluated by using (2.1) and the Gauss sums in semi-primitive case (see, e.g., **[3, Theorem 2]**): for ,
[TABLE]
The following is our main result in this section.
Theorem 3.2**.**
- (1)
Assume that , and define
[TABLE]
Then is a set of type Q in .
- (2)
Assume that and , and define
[TABLE]
Then is a set of type Q in .
This theorem obviously generalizes the construction of type Q sets given by Chen [4]. Indeed, we used , , instead of , , in the definition of and (see Subsection 2.2). This new construction is much more flexible than that in [4].
To prove this theorem, we will evaluate the character values , , by a series of the following lemmas. We first treat the case where .
Lemma 3.3**.**
For and , it holds that
[TABLE]
**Proof: **Since , by Remark 3.1 (ii),(iii), we have . Then, we have
[TABLE]
This completes the proof.
Lemma 3.4**.**
For and , we have
[TABLE]
**Proof: **Since and , by Remark 3.1 (ii),(iii), we have and . Then, we have
[TABLE]
Finally, by Remark 3.1 (iv), (3.4) is reformulated as
[TABLE]
This completes the proof.
We next treat the case where . Let , , be defined as in Remark 3.1 (i). Define
[TABLE]
Then, the character values of , , are given by
[TABLE]
and
[TABLE]
Lemma 3.5**.**
If , it holds that
[TABLE]
**Proof: **If , we have
[TABLE]
If , there are no such that ; we have . If , continuing from (3.7), we have
[TABLE]
This completes the proof.
Lemma 3.6**.**
If , we have
[TABLE]
**Proof: **If , we have
[TABLE]
If , there are no such that ; hence . If , continuing from (3.8), we have
[TABLE]
This completes the proof.
Lemma 3.7**.**
If , we have
[TABLE]
**Proof: **Note that and . Since , we have
[TABLE]
This completes the proof.
Proof of Theorem 3.2: In the case where , the statement follows from Lemmas 3.3 and 3.4. We now treat the case where . By the evaluations for in Lemmas 3.5–3.7, we have
[TABLE]
(1) Since , by Remark 3.1 (iv), we have
[TABLE]
(2) Since and , we have
[TABLE]
This completes the proof of the theorem.
Corollary 3.8**.**
Let , , be arbitrary -subsets of and be the sets defined as in (3.1) and (3.2). Furthermore, define
[TABLE]
Then, the sets
[TABLE]
are of type Q, where the subscript of is reduced modulo . Furthermore, these sets satisfy the assumptions of Remark 2.6 with respect to the spread consisting of the following -dimensional subspaces:
[TABLE]
**Proof: **By Theorem 3.2, and are type Q sets. Furthermore, since and , the sets and are also of type Q. Finally, , , satisfy the assumption of Remark 2.6 as C_{0}\cup C_{2}\cup\{(0,0)\}=\big{(}\bigcup_{y\in A_{0}\cup A_{1}}K_{y}\big{)}\cup K_{\infty} and .
4. A generalization of Wilson-Xiang’s examples
4.1. The Setting
We fix notation used in this section. Let be a prime power and be a primitive element of . Let be any fixed odd integer in .
Define the following subsets of :
[TABLE]
Then , , and . Furthermore, define
[TABLE]
It is clear that the ’s partition . In the appendix, we will show that the ’s have the following properties:
- (P1)
, ;
- (P2)
, , ;
- (P3)
;
- (P4)
or according as or .
- (P5)
;
- (P6)
By the properties (P2) and (P5), we can assume that and . Then, . Furthermore, and or and according as or .
- (P7)
Define , . Then, takes the character values listed in Table 1:
In the language of association schemes, the Cayley graphs on with connection sets ’s, together with the diagonal relation arising from the connection set , form a -class translation association scheme. Here, ’s are subsets of defined as the index sets of the dual association scheme.
- (P8)
, ;
- (P9)
;
- (P10)
Define , . Then, takes the character values listed in Table 2:
4.2. The Construction
Let , , , , , be sets defined as in Subsection 4.1. Let and be subsets of satisfying and as multisets, . It follows that .
Let or according as or . Define
[TABLE]
We denote the set of even (resp. odd) elements in any subset of by (resp. ). The following is our main result in this section.
Theorem 4.1**.**
- (1)
If and , then is a type Q set in .
- (2)
If , and , then is a type Q set in .
This theorem generalizes the examples of type Q sets found by Wilson-Xiang [12]. Indeed, these sets admit the automorphism . See Subsection 2.2.
To prove the theorem above, we will evaluate the character values of , . Define
[TABLE]
Noting that each element in (resp. ) appears exactly twice when runs through and runs through (resp. ), we have and . We will evaluate these character sums by considering two cases: (i) exactly one of is zero; and (ii) and . We first treat Case (i).
Lemma 4.2**.**
If exactly one of is zero, then
[TABLE]
**Proof: **If and , it is clear that . Furthermore, since , we have
[TABLE]
Hence, . If and , we have
[TABLE]
Since and , we have and . Hence, (4.2) is reformulated as
[TABLE]
Finally, by (2.2), the statement follows.
Lemma 4.3**.**
If exactly one of is zero, then
[TABLE]
**Proof: **If and , it is clear that . Since , we have
[TABLE]
Hence, . If and ,
[TABLE]
Since and , (4.3) is reformulated as
[TABLE]
Finally, by (2.2), the statement follows.
We next consider Case (ii), i.e., and .
Lemma 4.4**.**
If and , then
[TABLE]
*where is a multiplicative character of order of and is the quadratic character of . *
**Proof: **Let be a multiplicative character of order of . By (2.1), we have
[TABLE]
Since or [math] according as or not, continuing from (4.5), we have
[TABLE]
Let and . Since or [math] according as or not, continuing from (4.6), we have
[TABLE]
Similarly, we have
[TABLE]
This completes the proof of the lemma.
Let (resp. ) be the contribution for (resp. ) in the summations of (4.4); then .
Lemma 4.5**.**
Let . Then,
[TABLE]
depending on whether or .
**Proof: **By the definition of , we have
[TABLE]
Since as a multiset, by the property (P7), we have
[TABLE]
Then, by (2.3), we have
[TABLE]
Then, by (2.1), we have
[TABLE]
Since , , from the property (P8), we have by the property (P10) that for
[TABLE]
Furthermore, since by the property (P9), we have
[TABLE]
Similarly, we have
[TABLE]
Summing up, we have
[TABLE]
according as or . This completes the proof.
We next evaluate below.
Lemma 4.6**.**
Let . Then,
[TABLE]
**Proof: **By the definition of , we have
[TABLE]
By applying the Davenport-Hasse product formula (Theorem 2.3) with , , and we have
[TABLE]
where has order . Then, (4.7) is rewritten as
[TABLE]
We will compute by dividing it into three parts. Let denote the contributions in the sum on the right hand side of (4.8) when ; other even ; and odd , respectively. Then . For , we have
[TABLE]
Next, by Theorem 2.2, we have
[TABLE]
By the property (P2),
[TABLE]
Hence, continuing from (4.9), we have
[TABLE]
Finally, by Theorem 2.2 again, we have
[TABLE]
Summing up, we have
[TABLE]
The statement now follows from .
Remark 4.7**.**
By Lemmas 4.5 and 4.6, we have
[TABLE]
according as or . By the property (P4), or depending on whether or . Hence, continuing from (4.16), we have
[TABLE]
We are now ready to prove our main theorem.
**Proof of Theorem 4.1: ** In the case where exactly one of is zero, the statement follows from Lemmas 4.2 and 4.3. We treat the case where and .
(1) By (2.2), . Furthermore, by and , we have
[TABLE]
Hence, by (4.17), it follows that .
(2) By (2.2), . Furthermore, by , , and , we have
[TABLE]
Hence, by (4.17), it follows that .
Corollary 4.8**.**
Let , , , and , where are defined as in the property (P6). Then, the sets
[TABLE]
are of type Q. Furthermore, these sets satisfy the assumptions of Remark 2.6 with respect to the spread consisting of the following -dimensional subspaces:
[TABLE]
**Proof: **By the property (P6), and . Hence, by Theorem 4.1, and are type Q sets. Since and , the sets and are also of type Q. Furthermore, since by the properties (P1),(P4),(P5) and (P6). Therefore, , , satisfy the assumptions of Remark 2.6 as C_{0}\cup C_{2}\cup\{(0,0)\}=\big{(}\bigcup_{y\in H_{0}}K_{y}\big{)}\cup K_{\infty} and , where and .
Appendix
In this appendix, we prove that the sets and , , have the properties (P1)–(P10).
By the definition of , we have
[TABLE]
Hence, there are such that . In particular, we have
[TABLE]
Lemma 4.9**.**
We have for some or according as or .
**Proof: **By (4.18), we have
[TABLE]
Putting , the conditions in (4.19) are rewritten as
[TABLE]
for some . Here, is odd if , and is even if . By multiplying these equations, we have . Then, the statement immediately follows.
Remark 4.10**.**
For , , we observe the following facts:
- (1)
Since , we have , , and . Hence, the property (P1) follows.
- (2)
Since forms a relative difference set (cf. **[1*]**), we have . Then, the property (P2) follows. *
- (3)
Since and , we have . Then, the property (P3) follows.
- (4)
The property (P4) directly follows from Lemma 4.9.
- (5)
By Lemma 4.9, for some or according to whether or . Then, it is direct to see that and in all cases. More precisely, since . Hence, and . Thus, the properties (P5) and (P6) follow.
Next, we show that the ’s have property (P7).
Proposition 4.11**.**
Let , , be defined as in Subsection 4.1. Then, , , take the character values listed in Table 1. In particular, ’s in Table 1 are determined as follows:
[TABLE]
**Proof: **The character values , , are evaluated as follows:
[TABLE]
where
[TABLE]
By (4.18), it is direct to see that
[TABLE]
Hence, we have and .
The character values of is determined as .
We next evaluate , . By Remark 3.1 (i), the indicator function of is given by
[TABLE]
Then,
[TABLE]
We treat the case where . If , then and , and hence . If , then and , and hence . If , then and , and hence . If , then and , and hence . Next, we treat the case where . Define
[TABLE]
Then, we have
[TABLE]
We need to show that , . Let . Then, there are some such that . Taking trace of both sides of , we have . Since and , we obtain , i.e., . On the other hand, taking trace of both sides of , we have . Since and , we obtain , i.e., . Thus, , and hence . Noting that , it follows that . Furthermore, since and , we have and
Finally, the character values of and are determined as and . This completes the proof of the proposition.
Remark 4.12**.**
By the definition of , , in Proposition 4.11, it is clear that , that is, the property (P8).
Next, we show that the ’s have property (P9).
Proposition 4.13**.**
We have
[TABLE]
**Proof: **Since for as in the proof of Proposition 4.11, we have
[TABLE]
Assume that . There are some such that . On the other hand, since , for some or . Then, we have
[TABLE]
By multiplying both sides of (4.20) by and taking trace, we have
[TABLE]
Since by the definition of , (4.21) is reduced to
[TABLE]
where and . Here, by (4.18). Furthermore, by the definitions of , and by the definitions of . Hence, either or holds by noting that is impossible. Therefore, , i.e., , follows. Finally, since , the statement of the proposition follows.
Finally, we show that the ’s have property (P10).
Proposition 4.14**.**
Let , , be defined as in Subsection 4.1. Then, , , take the character values listed in Table 2.
**Proof: **Since by Lemma 4.9, Remark 4.10 (5) and the definitions of , , the statement follows from Proposition 4.11.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. T. Arasu, J. F. Dillon, D. Jungnickel, A. Pott, The solution of the Waterloo problem, J. Combin. Theory, Ser. A 71 (1995), 316–331.
- 2[2] B. Berndt, R. Evans, K. S. Williams, Gauss and Jacobi Sums , Wiley, 1997.
- 3[3] A. E. Brouwer, R. M. Wilson, Q. Xiang, Cyclotomy and strongly regular graphs, J. Alg. Combin. 10 (1999), 25–28.
- 4[4] Y. Q. Chen, On the existence of abelian Hadamard difference sets and a new family of difference sets, Finite Fields Appl. 3 (1997), 234–256.
- 5[5] J. A. Davis, Difference sets in abelian 2-groups, J. Combin. Theory, Ser. A 57 (1991), 262–286
- 6[6] M. van Eupen, V. D. Tonchev, Linear codes and the existence of a reversible Hadamard difference set in ℤ 2 × ℤ 2 × ℤ 5 4 subscript ℤ 2 subscript ℤ 2 superscript subscript ℤ 5 4 {\mathbb{Z}}_{2}\times{\mathbb{Z}}_{2}\times{\mathbb{Z}}_{5}^{4} , J. Combin. Theory, Ser. A 79 (1997), 161–167.
- 7[7] D. Jungnickel, Difference Sets . Contemporary design thepry, 241–324, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley-Intersci. Publ., Wiley, New York, 1992.
- 8[8] R. G. Kraemer, Proof of a conjecture on Hadamard 2 2 2 -groups, J. Combin. Theory, Ser. A 63 (1993), 1–10.
