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 finite fields, and the main tools that we employed are Gauss sums. In particular, these obtained codebooks are asymptotically optimal with respect to the Welc...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-01-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2024132?viewType=HTML |