A new construction of asymptotically optimal codebooks-Reference-Cited by-同舟云学术

A new construction of asymptotically optimal codebooks

Published:2024 Issue:4 Volume:9 Page:9631-9640
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Yan Yang¹,Chen Hanning²³⁴,Wang Jianming⁴⁵,Wang Gang⁶

Affiliation:

1. School of Information Technology and Engineering, Tianjin University of Technology and Education, Tianjin 300222, China

2. Engineering Research Center of Integration and Application of Digital Learning Technology, Ministry of Education, Beijing 100039, China

3. Tianjin Swom Technology Development Co., Ltd., Tianjin 300387, China

4. School of Computer Science, Tiangong University, Tianjin 300387, China

5. Tianjin Key Laboratory of Autonomous Intelligence Technology and Systems, Tianjin 300387, China

6. College of Science, Civil Aviation University of China, Tianjin 300300, China

Abstract

<abstract><p>Codebooks with small cross-correlation amplitude have extensive applications in many fields including code division multiple access (CDMA) communications systems, space-time codes, and compressed sensing. In this paper, a class of asymptotically optimal codebooks was constructed, and the maximum inner-product of these presented codebooks was determined by using properties of character sums over finite fields. Furthermore, these codebooks provided new parameters.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Reference19 articles.

1. L. Welch, Lower bounds on the maximum cross correlation of signals, IEEE Trans. Inform. Theory, 20 (1974), 397–399. https://doi.org/10.1109/TIT.1974.1055219

2. Z. Heng, C. Ding, Q. Yue, New constructions of asymptotically optimal codebooks with multiplicative characters, IEEE Trans. Inform. Theory, 63 (2017), 6179–6187. https://doi.org/10.1109/TIT.2017.2693204

3. G. Luo, X. Cao, Two constructions of asymptotically optimal codebooks, Cryptogr. Commun., 11 (2019), 825–838. https://doi.org/10.1007/s12095-018-0331-4

4. G. Luo, X. Cao, Two constructions of asymptotically optimal codebooks via the hyper eisenstein sum, IEEE Trans. Inform. Theory, 64 (2018), 6498–6505. https://doi.org/10.1109/TIT.2017.2777492

5. Q. Wang, Y. Yan, Asymptotically optimal codebooks derived from generalised bent functions, IEEE Access, 8 (2020), 54905–54909. https://doi.org/10.1109/ACCESS.2020.2980330