基于奇异辛空间上码本的构造
The Construction of Codebook Based on Singular Symplectic Space
DOI: 10.12677/PM.2023.132018, PDF,    科研立项经费支持
作者: 林远鹏, 陈延林, 崔玉涛, 刘雪梅：中国民航大学理学院，天津；王钰洁, 张海纳：中国民航大学电子信息与自动化学院，天津
关键词: 奇异辛空间；码本；Welch界；Singular Symplectic Space； Codebook； Welch Bound
摘要: 码本可以应用于区分不同用户发出的信号的码分多址系统中，基于奇异辛空间构造了一类新的码本，运用奇异辛空间的计数定理，得到了码本的相关参数，计算了该新码本的最大互相关振幅，计算出了最大互相关振幅渐近到达Welch的限制条件，从而证明了根据奇异辛空间构造出的码本是渐近最优码本。
Abstract: The codebook can be used to distinguish the signals sent by different users in the code division multiple access system. Based on the singular symplectic space, a new codebook is constructed. Using the counting theorem of the singular symplectic space, the relevant parameters of the codebook are obtained, the maximum cross-correlation amplitude of the new codebook is calcu-lated, and the limiting conditions for the maximum cross-correlation amplitude to reach mathbit Welch asymptotically are calculated. It is proved that the codebook constructed from singular symplectic space is asymptotically optimal.
文章引用：林远鹏, 陈延林, 崔玉涛, 王钰洁, 张海纳, 刘雪梅. 基于奇异辛空间上码本的构造[J]. 理论数学, 2023, 13(2): 158-165. https://doi.org/10.12677/PM.2023.132018

参考文献

[1] Welch, L. (1974) Lower Bounds on the Maximum Cross Correlation of Signals. IEEE Transactions on Information Theory, 20, 397-399. [Google Scholar] [CrossRef] 
[2] Sarwate, D.V. (1999) Meeting the Welch Bound with Equality. In: Ding, C., Helleseth, T. and Niederreiter, H., Eds., Sequences and Their Applications. Discrete Mathematics and Theoretical Computer Science, Springer, London, 79-102. [Google Scholar] [CrossRef] 
[3] Candès, E.J. and Wakin, M.B. (2008) An Introduction To Compressive Sampling. IEEE Signal Processing Magazine, 25, 21-30. [Google Scholar] [CrossRef] 
[4] Xia, P., Zhou, S. and Giannakis, G.B. (2005) Achieving the Welch Bound with Difference Sets. IEEE Transactions on Information Theory, 51, 1900-1907. [Google Scholar] [CrossRef] 
[5] Conway, J.H., Harding, R.H. and Sloane, N.J.A. (1996) Packing Lines, Planes, Etc.: Packings in Grassmannian Spaces. Experimental Mathematics, 5, 139-159. [Google Scholar] [CrossRef] 
[6] Ding, C. (2006) Complex Codebooks from Combinatorial Designs. IEEE Transactions on Information Theory, 52, 4229-4235. [Google Scholar] [CrossRef] 
[7] Fickus, M., Mixon, D.G. and Tremain, J.C. (2012) Steiner Equi-angular Tight Frames. Linear Algebra and Its Applications, 436, 1014-1027. [Google Scholar] [CrossRef] 
[8] Fickus, M. and Mixon, D.G. (2015) Tables of the Existence of Equiangular Tight Frames. ArXiv: 1504.00253.
[9] Fickus, M., Mixon, D.G. and Jasper, J. (2016) Equiangular Tight Frames from Hyperovals. IEEE Transactions on Information Theory, 62, 5225-5236. [Google Scholar] [CrossRef] 
[10] Massey, J.L. and Mittelholzer, T. (1993) Welch’s Bound and Se-quence Sets for Code-Division Multiple-Access Systems. In: Capocelli, R., De Santis, A. and Vaccaro, U., Eds., Se-quences II, Springer, New York, 63-78. [Google Scholar] [CrossRef] 
[11] Ding, C. and Feng, T. (2008) Codebooks from Almost Differencesets. Designs, Codes and Cryptography, 46, 113-126. [Google Scholar] [CrossRef] 
[12] Zhang, A.X. and Feng, K.Q. (2012) Construction of Cyclotomic Codebooks Nearly Meeting the Welch Bound. Designs, Codes and Cryptography, 63, 209-224. [Google Scholar] [CrossRef] 
[13] 张爱仙, 何春燕, 吉喆. 几类近似达到Welch界码本的构造[J]. 纯粹数学与应用数学, 2018, 34(3): 323-330.
[14] 刘雪梅, 贾丽华. 基于有限域上仿射空间构造新码本[J]. 中国民航大学学报, 2021, 39(3): 62-64.
[15] Wan, Z.X. (2002) Geometry of Classical Groups over Finite Field. 2nd Edition, Science Press, Beijing.

为你推荐