A construction of strongly regular Cayley graphs and their applications to codebooks

: In this paper, we give a kind of strongly regular Cayley graphs and a class of codebooks. Both constructions are based on choosing subsets of ﬁnite ﬁelds, and the main tools that we employed are Gauss sums. In particular, these obtained codebooks are asymptotically optimal with respect to the Welch bound and they have new parameters.


Introduction
Let Γ be a strongly regular graph with v vertices and parameters k, λ and µ.Then Γ is defined as follows: (1) For any two adjacent vertices x and y, there are exactly λ vertices adjacent to both x and y; (2) for any two nonadjacent vertices x and y, there are exactly µ vertices adjacent to both x and y.For a more detailed introduction on strongly regular graphs, please refer to [1,2].
Cayley graphs are an effective tool constructing strongly regular graphs.Let (G, +) be a finite abelian group and S be a subset of G \ {0} such that S = −S , where 0 is the identity of G.The Cayley graph Cay(G, S ) is defined as the graph Γ(G, E) where two vertices a and b are adjacent if and only if a − b ∈ S .Let G be the character group of G consisting of all characters of G.The eigenvalues of Cay(G, S ) are given by φ(S ) = x∈S φ(x), where φ ∈ G.It is well known that Cay(G, S ) is strongly regular if and only if φ(S ) with φ ∈ G \ {1 G } take exactly two values, where 1 G is the identity of G.By the determination of Cayley graphs in the additive groups of finite fields, strongly regular cayley graphs were proposed in [3][4][5][6].
It should be noted that strongly regular graphs are related to some combinational objects, such as linear codes, two-intersection sets and partial difference set [7,8].For these connections, we are inspired to construct asymptotically optimal codebooks by using the connection set S of Cay(G, S ).An (N, K) codebook C is defined to be a set {c i } N−1 i=0 of N units norm 1 × K complex vectors c i , and c i (0 ≤ i ≤ N − 1) are called codewords of the codebook C. As an important measure of performance of a codebook C in code-division multiple access system, the maximum correlation amplitudes I max (C) is defined by where c H j denotes the conjugate transpose of a complex vector c j .Minimizing I max (C) is a meaningful problem as it can optimize some performance metrics such as average signal-to-noise ratio and outage probability.Hence, for a given K, it is desirable to construct codebooks with N as large as possible and I max (C) as small as possible simultaneously.Unfortunately, there is a tradeoff among the parameters N, K and [9].If C achieves the Welch bound, that is, I max (C) = I w (C), then C is referred to as a Welch-bound-equality codebook.In ordinary circumstance, it is extremely difficult to construct codebooks achieving the Welch bound.As a consequence, researchers attempt to construct codebooks asymptotically meeting the Welch bound, that is, I max (C) is slightly higher than I w (C), but lim N→∞ I max (C)/I w (C) = 1 [10][11][12].
This paper is organized as follows.Some interesting mathematical foundations will be introduced in Section II.Based on these related character sums, a class of strongly regular graphs and nearly optimal codebooks are presented in Section III.In addition, these constructed codebooks have new parameters.
For convenience, we use the following notations in the following sequel.
• m, s are positive integers and n = ms.
• p is an odd prime and q = p n .
• Tr n m denotes the trace function from is a p-th primitive root of complex unity.
• η n and η m denote the quadratic characters of F p n and F p m , separately.
• χ n and χ m denote the canonical additive characters of F p n and F p m , separately.
• µ a denotes an additive character of F p n for a ∈ F p n .

Preliminaries
In this section, we start with characters of finite fields.To prove the main results of this letter, we need a number of results on exponential sums that are derived for the proofs.
For an odd prime p, let q = p n and F q denote the finite field with q elements.Then Tr n m is defined by and Tr n m is called the trace function from F p n to F p m .An additive character of F p n is a homomorphism χ from the additive group of F p n to the multiplicative group of complex numbers of absolute value 1.The function defines an additive character of F p n and χ n is called the canonical additive character of F p n .For a ∈ F p n , define Obviously, µ a is also an additive character of F p n .And every additive character of F p n can be obtained in this way [13].Its orthogonality relation is given by Let β be a primitive element of F q .For a fixed integer j, 0 ≤ j ≤ q − 2, the function defines a multiplicative character of F q .In this paper, we use η n to denote the quadratic character χ (q−1)/2 of F q .And the quadratic character η n is extended by letting η n (0) = 0.The orthogonality relation for quadratic characters is given by where η k is the quadratic character of F p k and k is a positive integer.The Gauss sum G(η m , χ m ) over F p m is defined by [13] G where η m and χ m are the quadratic and canonical additive characters of F p m , respectively.The Gauss sum G(η m , χ m ) can be evaluated explicitly and the result on G(η m , χ m ) is given in the following lemma.
Lemma 1. [13, Theorem 5.15] Let F p m be the finite field with p m element, where p is an odd prime.Then where p * = −1 p p.
Hence, we shall abbreviate G(η m , χ m ) to G m .The following lemma establishes a relationship between the quadratic character η m and the canonical additive character χ m of F p m .Lemma 2. [13, p. 195] With symbols and notations above, we have Let f (x) be a function from F q to F p .The Walsh transform of f is defined by The following lemma states a property of the Walsh transform of f (x) = αx 2 , where α ∈ F * q .
[14] For α ∈ F * q , the Walsh transform coefficient of Tr n 1 (αx 2 ) is equal to where β ∈ F q and p * = −1 p p. Below we give a few results which are used to obtain the main results of this paper.Lemma 4. Let symbols be the same as before.Then we have: ( For n = ms, we have This means that the parity of (p n − 1)/(p m − 1) is the same as s.Hence, we have Lemma 5. [13, Theorem 5.12] For y ∈ F p m , we obtain

Proofs and main results
In this section, we provide a construction of strongly regular Cayley graphs and a family of asymptotically optimal codebooks.For α ∈ F * q , let The following lemma gives the cardinality of the special subset D α of F q .
Lemma 6.Let symbols be the same as before.Then the cardinality |D α | of D α is given by: (1) If s is even, then (2) If s is odd, then Proof.In order to determine the cardinality of D α , we firstly compute the values of the following two equalities: It is clear that Hence, we obtain Now we determine the values of A 2 .By Lemma 2, we have where the last equality follows from the fact that a∈F * p m η m (a) = 0 and Lemma 4. By definition, we deduce that Tr n m (αx 2 ) 0 The results of this lemma follow from (3.4)-(3.6).(1) If s is an even integer, then where B = (−1) n+m (p * ) χ n (zαx 2 + ax).
By Lemma 3, we get From the map z → − 1 z , we obtain When s is even, from Lemmas 4 and 5, we have the result (1) of this lemma.When s is odd, the desired result follows from Lemmas 4 and 5. (1) If s is even, then From the map z → − 1 z , we derive that The desired result follows from (3.8), Lemmas 4 and 5.
Theorem 9. Let symbols be the same as before and s ≥ 2 be even.Then the Cayley graph Cay(F p n , D α ) is strongly regular with non-trivial eigenvalues Proof.For a ∈ F * p n , we deduce that where the last equality follows from that η m (0) = 0. Then the desired conclusions follow from Lemmas 7 and 8.
Remark 1.Let s > 1 be an odd integer.Then the eigenvalues of the Cayley graph Cay(F p n , D α ) can also be computed by a similar method given in Theorem 9.It can be easily checked that where a ∈ F * p n and B = (−1) n+m η n (−α)(p * ) m+n 2 /p m .This means that the Cayley graph Cay(F p n , D α ) is not strong regular if s is odd.
Motivated by the work in [15], we give a construction of asymptotically optimal codebooks based on the strongly regular Cayley graph Cay(F p n , D α ) defined in Theorem 9.For α ∈ F * p n , let where c α,a = 1 and let s ≥ 2 be a fixed even integer.Then C α defined by (3.9) is an asymptotically optimal codebook with parameters [p n , K].
Proof.By the definition of C α and Lemma 6, we deduce that C α is a [p n , K] codebook.For any two distinct codewords c a and c b in C α (i.e., a b ∈ F p n ), it can be easily checked that It follows from Theorem 9 that which implies that According to the Welch bound, we have It is easy to check that lim which means that the codebook C α is asymptotically optimal with respect to the Welch bound.
Remark 2. Many readers may wonder what parameters the codebook C α has when s is an odd integer and whether it is asymptotically optimal.If s is odd, then by Theorems 6 and 9 we know the codebook C α defined in (3.9) has parameters It can be verified that lim which implies that C is not asymptotically optimal.
In Table 1, we assume that α is a primitive element of F * p n , p = 3 and s = 4.And we show some parameters of the codebook C α in this table.From Table 1, it can be seen that C α is asymptotically optimal with respect to the Welch bound for sufficiently large N.This also agrees with the result of Theorem 10.
To give a comparison, we present the parameters (N, K) of some known asymptotically optimal codebooks and the codebook defined in (3.9)

Conclusions
In this paper, we propose a method for constructing strongly regular graphs.Then we use the connection set D α (α ∈ F * p n ) of the strongly regular graph Cay(F * p n , D α ) to give a class of codebook C α .
In addition, the parameters [N, K] and I max (C α ) of the codebook C α are determined in Theorem 10.Table 1 demonstrates that these proposed codebooks are asymptotically optimal according to the Welch bound.

Use of AI tools declaration
The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

m+n 2 η
n (−α) p m .Proof.For a ∈ F * p n , by the orthogonality relation of µ a we get E α,a = −

n
= ms, s is even Thm.10 p n , p m −1 2p m C C = p n + η n (α)

Table 1 .
in Table2.From this table, we can conclude that C α has new parameters.The parameters of the codebook C α in (3.9) for p = 3 and s = 4.

Table 2 .
The parameters of codebooks asymptotically meeting the Welch bound.