环Z4上自对偶码的构造

利用有限环Z₄+vZ₄（其中v²=1）上自对偶码,给出了一种构造Z₄上自对偶码的方法.引入了（Z₄+vZ₄）ⁿ到Z₄²ⁿ的保距Gray映射,给出了Z₄+vZ₄上自对偶码的性质,证明了Z₄+vZ₄上长为n的自对偶码的Gray像是Z₄上长为2n的自对偶码,由此构造了Z₄上一些极优的类型I与类型Ⅱ自对偶码.     

环Z2m上一类常循环码的挠码及其应用

该文研究了环Z_2^m上任意长的（1+2λ）-常循环码的挠码及其应用.首先,给出环Z_2^m上（1+2λ）-常循环码的挠码.然后,利用挠码得到环Z_2^m上某些（1+2λ）-常循环码的齐次距离分布.同时,利用挠码证明了环Z_2^m上（2^m－1－1）-常循环自对偶码都是类型I码,并利用这类码构造了极优的类型I码.     

等重码的一些新结果

本文给出两种构造二元非线性等重码的方法，这些方法是［１］文构造二元非线性循环等重码方法的改进。通过我们的构造方法可以得到几类二元最优等重码。我们进一步说明通过ＧＦ（ｑ）上的等重码和达到Ｐｌｏｔｋｉｎ界的最优码可以构造达到Ｊｏｈｎｓｏｎ上界的二元最优等重码     

环F2+uF2的Galois扩张上的迹码

环E＋uF2是介于环Z4与域F4之间的一种四元素环，因此分享了环Z4与域F4的一些好的性质，此环上的编码理论研究成为一个新的热点。该文给出了环E＋uF2的Galois扩张的相关理论，指出此Galois扩环的自同构群不同于Z4环上的Galois扩环的自同构群；定义了Galois扩环上的迹码的概念及子环子码的概念，证明了此Galois扩环上的一个码的对偶码的迹码是该环的子环子码的对偶码。     

环Z4+uZ4线性码关于李重量的一类MacWilliams恒等式

MacWilliams恒等式是研究线性码及其对偶码的码字重量分布的一个非常有用的工具,而码字的重量分布的研究是编码研究中一个非常重要的研究方向.本文定义了环Z4+uZ4上长度为n的线性码的m-层李重量计数器,给出了环Z4+uZ4上长度为n的线性码关于李重量的一类MacWilliams恒等式.证明了该等式是生成矩阵在环Z4+uZ4上的环GR(4,m)+uGR(4,m)上线性码关于李重量的MacWilliams恒等式.进一步,利用Krawtchouk多项式,获得了环Z4+uZ4上长度为n的线性码的等价形式MacWilliams恒等式.     

On 2D finite support convolutional codes: An algebraic approach

Two-dimensional (2D) finite codes are defined as families of compact support sequences indexed in Z × Z and taking values in F ⁿ , F a Galois field. Several properties of encoders, decoders and syndrome decoders are discussed under different hypotheses on the code structure, and related to the injectivity and primeness of the corresponding polynomial matrices in two variables. Dual codes are finally introduced as families of parity checks on a given modular code, and related to the standard theory of 2D behaviors.     

环Fq+uFq++uk-1Fq上一类重根常循环码

记R=Fq+uFq++uk-1Fq,G=R[x]/,且是R中可逆元。定义了从Gn到Rtn的新的Gray映射,证明了J是G上长为n的线性的x-常循环码当且仅当(J)是R上长为tn的线性的-常循环码。使用有限环理论,获得了环R上长为pe的所有的(u-1)-常循环码的结构及其码字个数。特别地,获得了环F2m+uF上长为2e的(u-1)-常循环码的对偶码的结构及其码字个数。推广了环Z2a根负循环码的若干结果。     

Asymptotic performance comparison of concatenated (turbo) codes over GF(4)

In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWGN) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non‐binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k₀/(k₀ + 1) for k₀=1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight‐two and weight‐three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns. Copyright © 2004 John Wiley & Sons, Ltd.     

有限域上两类新的2-重量码的构造

有限域上二重量码的构造是图论、编码与密码中的重要研究课题.本文得到了有限域上两类新的2-重量码并且它们都是最优的,达到了Griesmer界.这些码由有限域的扩域上迹码的p元像定义,有阿贝尔码的代数结构,利用特征和和高斯和来计算了它们的重量分布.我们也计算了这些像码的对偶码的极小距离.最后对扩域上迹码的像在秘钥共享方案中的应用进行了刻画.     

环Ｆ2+uＦ2上长为2e的循环码

近十多年来,有限环上的循环码一直是编码研究者所关心的热点问题,本文证明了R[x]/＜xn-1＞不是主理想环,其中R=F2 uF2,u2=0且n=2e.分3种情形讨论了环R[x]/＜xn-1＞中的非零理想,并给出了R上循环码的可以唯一确定的生成元的表达形式,同时给出了R上循环码的李距离的一个上界估计.     

环R+vR+v2R上线性码的MacWilliams恒等式

通过构造Gray映射,对环R+vR+v²R上线性码进行了研究.定义了环R+vR+v²R上线性码的Lee重量及其几类重量计数器,给出了环R+vR+v²R上线性码及其对偶码之间的各种重量分布的MacWilliams恒等式.利用这些恒等式,不用求出环R+vR+v²R上线性码的对偶码便可得到对偶码的各种重量分布.     

环F2+uF2的Galois扩张上的迹码

环F2+uF2是介于环Z4与域F4之间的一种四元素环,因此分享了环Z4与域F4 的一些好的性质,此环上的编码理论研究成为一个新的热点。该文给出了环F2+uF2 的Galois扩张的相关理论,指出此Galois扩环的自同构群不同于Z4环上的Galois扩环的自同构群;定义了Galois扩环上的迹码的概念及子环子码的概念,证明了此Galois扩环上的一个码的对偶码的迹码是该环的子环子码的对偶码。     

[[2n, n]] ADDITIVE QUANTUM ERROR CORRECTING CODES

The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3], where B, are the binary n x n matrices, I is an identity matrix. By the use of the binary codes that generated by [B1 I B2 B2 BT1], asymptotic good [[2n, n]] additive quantum codes are obtained.     

域F2上的三次剩余码

对于某个奇素数P,我们给出了判断2是mod p的三次剩余的一个引理,由此引理,我们定义了有限域F2上的6种三次剩余码;研究了6种三次剩余码之间的关系,得出了三次剩余码的码长、重量特征和极小汉明距离范围;最后给出了三次剩余码的对偶码的生成多项式,以及在选择适当的P次本原单位根的情况下,给出了它的生成幂等多项式。     

Analysis and performance evaluation of new coding options for space telecommand links ‐ Part I: AWGN channels

We investigate and compare, over the additive white Gaussian noise channel, different options for updating the error correcting code currently used in space mission telecommand links. Besides some more consolidated proposals, using low‐density parity‐check codes, we characterize and assess the performance of alternative schemes, based on parallel turbo codes and soft‐decision decoded Bose‐Chaudhuri‐Hocquenghem (BCH) codes. The analysis considers relevant metrics like the codeword error rate, the frame error rate, and the undetected frame error rate. The considered codes include binary and non‐binary low‐density parity‐check codes, parallel turbo codes and extended BCH codes, with different decoding algorithms. The complexity of the various schemes and possible limits for their application are considered and discussed. Several numerical examples are provided. International Journal of Satellite Communications and Networking. Copyright © 2014 John Wiley & Sons, Ltd.     

一类环长至少为10的准循环LDPC码

为扩展性能优良、易于工程实现的LDPC码的构造方法,提出了一类环长至少为10的准循环低密度奇偶校验(quasi-cyclic low-density parity-check, QC-LDPC)码的构造方法。该方法首先基于基矩阵和 准则[11]构造出环长至少为10的校验矩阵;然后,利用掩蔽矩阵对得到的校验矩阵进行变换;最终,构造出满秩的准循环LDPC码。理论分析和仿真结果表明,该类QC-LDPC码字构造灵活,在AWGN信道下具有优异的性能。     

A Theoretical Method for Estimating Performance of Reed-Solomon Codes Concatenated with Orthogonal Space-Time Block Codes

1　ＩｎｔｒｏｄｕｃｔｉｏｎＲｅｃｅｎｔｌｙ,ａｎｅｗｓｐａｃｅ ｔｉｍｅｃｏｄｅａｄａｐｔｅｄｔｏｍｕｌｔｉｐｌｅａｎｔｅｎｎａｓｗｉｒｅｌｅｓｓｆａｄｉｎｇｃｈａｎｎｅｌｈａｓｂｅｅｎｐｒｏｐｏｓｅｄ[1～6] .Ｔｈｅｃｏｄｅｓａｒｅｔｈｅｊｏｉｎｔｄｅｓｉｇｎｏｆｃｏｄｉｎｇ ,ｍｏｄｕｌａｔｉｏｎ ,ｔｒａｎｓｍｉｓｓｉｏｎａｎｄｒｅｃｅｐｔｉｏｎｄｉ ｖｅｒｓｉｔｙｔｏ ｐｒｏｖｉｄｅｔｈｅｂｅｓｔｔｒａｄｅｏｆｆｂｅｔｗｅｅｎｄａｔａｒａｔｅｓ,ｄｉｖｅｒｓｉｔｙａｄｖａｎｔａｇｅａｎｄｃｏｄｅｓ…     

Z4×(F2+uF2)上的一类循环码

定义了Z₄×（F₂+uF₂）上的循环码,明确了一类循环码的生成元结构,给出了该类循环码的极小生成元集.利用Gray映射,构造了一些二元非线性码.     

DVB-S2中LDPC码生成法解析

文章在详细分析DVB-S2标准的基础上,研究了DVB-S2中LDPC码的码字构造法则,推导出校验矩阵结构并进行分析,得出DVB-S2中LDPC码的相关参数。同时对标准中的一类码在AWGN信道中进行了仿真,仿真结果表明,这类码性能优异,具有很强的纠错能力。     

Convolutional fountain distribution over fading wireless channels

Mobile broadband has opened the possibility of a rich variety of services to end users. Broadcast/multicast of multimedia data is one such service which can be used to deliver multimedia to multiple users economically. However, the radio channel poses serious challenges due to its time‐varying properties, resulting in each user experiencing different channel characteristics, independent of other users. Conventional methods of achieving reliability in communication, such as automatic repeat request and forward error correction do not scale well in a broadcast/multicast scenario over radio channels. Fountain codes, being rateless and information additive, overcome these problems. Although the design of fountain codes makes it possible to generate an infinite sequence of encoded symbols, the erroneous nature of radio channels mandates the need for protecting the fountain‐encoded symbols, so that the transmission is feasible. In this article, the performance of fountain codes in combination with convolutional codes, when used over radio channels, is presented. An investigation of various parameters, such as goodput, delay and buffer size requirements, pertaining to the performance of fountain codes in a multimedia broadcast/multicast environment is presented. Finally, a strategy for the use of ‘convolutional fountain’ over radio channels is also presented.