Codebooks are widely applied in code division multiple access communication systems.Based on the subspaces of singular linear spaces over the finite fields,two classes of new codebooks are constructed.Firstly,a kind o...Codebooks are widely applied in code division multiple access communication systems.Based on the subspaces of singular linear spaces over the finite fields,two classes of new codebooks are constructed.Firstly,a kind of binary codebooks are constructed by using the subspace of the singular linear space over the finite fields.According to the anzahl theorem,the parameters and the maximum correlation amplitude I_(max)(C)of the codebooks are calculated,and then given the conditions that the I_(max)(C)asymptotically reaches the Welch bound.On this basis,by mixing with Hadamard matrices,the number of columns are increased and obtain another class of new code,which further relaxes the conditions that the I_(max)(C)asymptotically reaches the Welch bound.展开更多
As a generalization of singular linear spaces, we introduce the concept of t-singular linear spaces, make some anzahl formulas of subspaces, and determine the suborbits of t-singular linear groups.
基于仿射奇异线性空间的子空间面之间的关联关系,构造了一个新的压缩感知矩阵,计算了所构造的压缩感知矩阵的相关性,并得到处理信号可以恢复的最大稀疏度,同时,与Ronald A DeVore利用有限域上的多项式构造的压缩感知矩阵进行比较,当两...基于仿射奇异线性空间的子空间面之间的关联关系,构造了一个新的压缩感知矩阵,计算了所构造的压缩感知矩阵的相关性,并得到处理信号可以恢复的最大稀疏度,同时,与Ronald A DeVore利用有限域上的多项式构造的压缩感知矩阵进行比较,当两个压缩感知矩阵处理信号的有效率相同时,基于仿射奇异线性空间构造的压缩感知矩阵处理信号的最大稀疏度优于Ronald A.DeVore构造的压缩感知矩阵处理信号的最大稀疏度。展开更多
文摘Codebooks are widely applied in code division multiple access communication systems.Based on the subspaces of singular linear spaces over the finite fields,two classes of new codebooks are constructed.Firstly,a kind of binary codebooks are constructed by using the subspace of the singular linear space over the finite fields.According to the anzahl theorem,the parameters and the maximum correlation amplitude I_(max)(C)of the codebooks are calculated,and then given the conditions that the I_(max)(C)asymptotically reaches the Welch bound.On this basis,by mixing with Hadamard matrices,the number of columns are increased and obtain another class of new code,which further relaxes the conditions that the I_(max)(C)asymptotically reaches the Welch bound.
文摘As a generalization of singular linear spaces, we introduce the concept of t-singular linear spaces, make some anzahl formulas of subspaces, and determine the suborbits of t-singular linear groups.
基金supported by NSFC(No.11471097)the NSF of Hebei Province(No.A2013408009)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20121303110005)the Key Fund Project of Langfang Teachers University(No.LSLZ201403)
文摘基于仿射奇异线性空间的子空间面之间的关联关系,构造了一个新的压缩感知矩阵,计算了所构造的压缩感知矩阵的相关性,并得到处理信号可以恢复的最大稀疏度,同时,与Ronald A DeVore利用有限域上的多项式构造的压缩感知矩阵进行比较,当两个压缩感知矩阵处理信号的有效率相同时,基于仿射奇异线性空间构造的压缩感知矩阵处理信号的最大稀疏度优于Ronald A.DeVore构造的压缩感知矩阵处理信号的最大稀疏度。
