Find Paper, Faster
Example:10.1021/acsami.1c06204 or Chem. Rev., 2007, 107, 2411-2502
New Constructions of Codebooks Nearly Meeting the Welch Bound
International Journal of Foundations of Computer Science  (IF0.416),  Pub Date : 2020-11-19, DOI: 10.1142/s012905412050032x
Zexia Shi, Lei Sun, Fang-Wei Fu

Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is difficult to construct such optimal codebooks. There have been a number of attempts to construct codebooks nearly meeting the Welch bound. In this paper, we introduce a generic construction of codebooks using generalized bent functions from 𝔽pn to pk, where p is a prime and k is a positive integer with 1<kn/2. With this construction, we obtain two new families of codebooks nearly meeting the Welch bound. These codebooks have new parameters and could have a small alphabet size. In particular, a class of regular generalized bent functions from 𝔽pn to pk is presented.