最大距离分割码误比特率的精确计算

基于最大距离分割(MDS)码的码重分布，得到了不完全译码器中发生译码错误和译码失败的概率．根据译码错误和译码失败对MDS码误比特率的影响，推导出精确的误比特率公式．利用该公式可计算出不同长度的MDS码在加性白高斯噪声(AWGN)信道中的误比特率．仿真结果表明，该公式比传统的误比特率上限公式具有更高的精度．     

MC-CDMA系统峰平功率比分布的研究

分析了MC-CDMA系统模型、MC-CDMA信号包络功率与所选用的扩频码序列部分自相关函数和部分互相关函数之间的关系，并基于几种正交扩频码序列对10位用户的MC-CDMA系统峰平功率比(PAPR)分布进行了仿真．仿真结果表明，当分别选用Walsh码、正交Gold码、Golay互补码以及Frank码作为系统扩频码时，系统PAPR的最大值约为6．如果选用Golay互补码作为扩频码，对于10位用户90％以上的信息符号序列，PAPR小于4．这些结论能够为多载波码分多址系统扩频码序列的选择提供帮助。     

面向三维信号的分组码

设Z[3√2]是代效效域Q（3√2）的代效整效环．把商环Z[3√2]／(2^Z)的乘法单位群分解为群的直积．由此获得三维信号空间并可用来构造分组码．这些码能够改正某些错误．     

基于卷积神经网络的多天线Polar码联合解调-解码方案

为了验证运用神经网络进行信道解码的可行性,利用其提高短码长Polar码的译码准确率,提出了一种基于卷积神经网络(convolutional neural network,CNN)的多天线(multiple-input multiple-output)Polar码新颖联合解调-解码方案.搭建了一种包括4个卷积层,2个全连接层和1个输出层的卷积神经网络,采用最小均方误差作为损失函数,通过计算机生成了Polar码编码的多天线数据并对网络进行训练,使训练得到的神经网络能很好地提取出Polar码比特间的关系特征,从而拟合出Polar码译码函数.仿真结果表明,在相同信噪比条件下,基于CNN的Po-lar码联合解调-解码方案的误码率优于已有的基于全连接神经网络方案;所提方案在不同码率的仿真实验中的误码率皆优于基于全连接神经网络方案,损失曲线的收敛速度更快,显示了基于CNN的Polar码联合解调-解码方案具有更好的泛化能力和学习能力.     

五元域上LCD码的构造

基于最优线性码与射影几何理论,针对不同码长最优码的距离特性,研究了低维五元最优LCD码的构造。首先利用删截等方法构造了较小码长的三维和四维最优线性码以及最优LCD码;其次,借助部分已知矩阵和删截等方法构造了较大码长的三维和四维最优线性码以及最优LCD码;最后,利用已知最优LCD码和特殊码长最优自正交码构造了任意大码长的最优LCD码,完全解决了三维和四维最优LCD码的构造问题。这些LCD码的构造方法对于五元高维最优LCD码以及一般域上最优LCD码的研究具有重要的理论指导意义。     

（1-uv）-CONSTACYCLIC CODES OVER Fp＋uFp＋vFp＋uvFp

Constacyclic codes are an important class of linear codes in coding theory.Many optimal linear codes are directly derived from constacyclic codes.In this paper,（1 — uv）-constacyclic codes over the local ring Fp ＋ uFp ＋ vFp ＋ uvFp are studied.It is proved that the image of a（1 — uv）-constacyclic code of length n over Fp ＋ uFp ＋ vFp ＋ uvFp under a Gray map is a distance invariant quasi-cyclic code of index p2 and length p3n over Fp.Several examples of optimal linear codes over Fp from（1 — uv）-constacyclic codes over Fp ＋ uFp ＋ vFp ＋ uvFp are given.     

Weighted symbol-flipping decoding algorithm for nonbinary LDPC codes with flipping patterns

A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed.The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space.Only one symbol is flipped in each iteration,and symbol flipping function,which is employed as the symbol flipping metric,combines the number of failed checks and the reliabilities of the received bits and calculated symbols.A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed.The design of flipping pattern’s order and depth,which is dependent of the computational requirement and error performance,is also proposed and exemplified.Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.     

一种围数为八的低密度校验码校验矩阵设计

提出了一种低密度校验（IDPC）码的规则校验矩阵设计算法．首先设计3个不同的子矩阵,每个子矩阵通过对单位矩阵进行不同的移位运算后组合生成,然后将这3个子矩阵组合生成所需要的低密度校验矩阵,最后利用文中提到的短环检验算法搜索出使得生成的校验矩阵四环数、六环数均为零的移位算子．用该校验矩阵所对应的生成矩阵对随机信息进行编码,AWGN信道下的仿真结果表明,具有逼近MacKay随机码的误码率性能．     

基于初等变换的量子码构造

为了探讨一般量子稳定子码的简单构造方法,在满足对偶包含条件C⊥(C)C的约束下,提出了从一类量子稳定子码C= [[N,K,D]]q到量子稳定子码C'=[[N-1,K+1,D']]q的基于矩阵初等变换的构造方法.该方法的优点在于码字构造时,量子稳定子码和经典纠错码都是在Fq上进行操作,无须做Fq2到Fq上的映射转换,也无...     

Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten

For an arbitrary (3,L) quasi-cyclic(QC) low-density parity-check (LDPC) code with girth at least ten, a tight lower bound of the consecutive lengths is presented. For an arbitrary length above the bound the corresponding LDPC code necessarily has a girth at least ten, and for the length equal to the bound, the resultant code inevitably has a girth smaller than ten. This new conclusion can be well applied to some important issues, such as the proofs of the existence of large girth QC-LDPC codes, the construction of large girth QC-LDPC codes based on the Chinese remainder theorem, as well as the construction of LDPC codes with the guaranteed error correction capability.