环F2[u]/(u4)上的一类常循环码及其Gray象

该文定义了环R=F2+uF2+u2F2+u3F2到F24的一个新的Gray映射,其中u4 =0.证明了R上长为n的(1+u+u2 +u3)-循环码的Gray象是F2上长为4n的距离不变的线性循环码.进一步确定了R上奇长度的该常循环码的Gray象的生成多项式,并得到了一些最优的二元线性循环码.     

F2+uF2+…+ukF2环上的循环码

在有限环F2＋uF2＋…＋u^k F2与F2之间定义一个新的Gray映射，证明了该映射是距离保持映射。考察了F2＋uF2＋…＋u^k F2环上循环码，得到了F2＋uF2＋…＋u^k F2环上循环码的生成多项式。最后，证明了F2＋uF2＋…＋u^k F2环上循环码在新定义的Gray映射下的像是F2上的准循环码。     

环 F_2+uF_2+…+u~(κ-1)F_2上长为2~s的(1+u)-常循环码的距离分布

研究码字的距离分布是编码理论的一个重要研究方向。该文定义了环R=F2+uF2++uk-1F2上的Homogeneous重量,研究了环R上长为2s的(1+u)-常循环码的Hamming距离和Homogeneous距离。使用了有限环和域的理论,给出了环R上长为2s的(1+u)-常循环码和循环自对偶码的结构和码字个数。并利用该常循环码的结构,确定了环R上长为2s的(1+u)-常循环码的Hamming距离和Homogeneous距离分布。     

环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根负循环码的若干结果。     

环Fq+uFq+...+uh-1Fq上任意长度的(u?-1)-常循环码

该文利用环同态理论,给出了环k 1 q q q R F uF u F =++L+-上任意长度N 的所有(ul -1)-常循环码的生成元, l 是R 的可逆元.证明了[]/1 N R x < x +-ul >是主理想环.给出了环R上任意长度N 的(ul -1)-常循环码的计数.确定了环R上任意长度N 的(ul -1)-常循环码的最高阶挠码的生成多项式,由此给出了环R上长度 s p 的所有(ul -1)-常循环码的汉明距离.     

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

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

环F2+uF2+…+uk-1F2上长为2S的(1+u)-常循环码的距离分布

研究码字的距离分布是编码理论的一个重要研究方向。该文定义了环R=F₂+uF₂+…+u^k-1F₂上的Homogeneous重量,研究了环R上长为2^S的(1+u)-常循环码的Hamming距离和Homogeneous距离。使用了有限环和域的理论,给出了环R上长为2^S的(1+u)-常循环码和循环自对偶码的结构和码字个数。并利用该常循环码的结构,确定了环R上长为2^S的(1+u)-常循环码的Hamming距离和Homogeneous距离分布。     

环F2+uF2上长度为2e的循环码的距离

确定码字的Hamming距离和Lee距离是解码的关键.本文对环F₂+uF₂上长度为2^e的循环码的结构进行了分类.确定了环F₂+uF₂上某些长度为2^e的循环码的Hamming距离和Lee距离.给出了环F₂+uF₂上长度为2^e的其它循环码的Hamming距离的上界及Lee距离的上界和下界.     

环 F2＋ uF2＋ u2 F2上的常循环码

常循环码是一类重要的纠错码,本文基于（xn －1）在 F2[x]上的分解,探讨了环 R＝ F2＋ uF2＋ u2 F2上任意长度的（1＋λu）常循环码的极小生成元集（λ为R上的单位）。通过分析该环上循环码和常循环码的置换等价性,得到了该环上码长为奇数及码长 N≡2（mod 4）时（1＋ u2）常循环码的生成多项式和极小生成元集。     

环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码.     

On the algebraic structure of quasi-cyclic codes .I. Finite fields

A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese remainder theorem (CRT), or of the discrete Fourier transform (DFT), that ring can be decomposed into a direct product of fields. That ring decomposition in turn yields a code construction from codes of lower lengths which turns out to be in some cases the celebrated squaring and cubing constructions and in other cases the (u+υ|u-υ) and Vandermonde constructions. All binary extended quadratic residue codes of length a multiple of three are shown to be attainable by the cubing construction. Quinting and septing constructions are introduced. Other results made possible by the ring decomposition are a characterization of self-dual quasi-cyclic codes, and a trace representation that generalizes that of cyclic codes     

Algebraic lower bounds on the free distance of convolutional codes

A new module structure for convolutional codes is introduced and used to establish further links with quasi-cyclic and cyclic codes. The set of finite weight codewords of an (n,k) convolutional code over F_q is shown to be isomorphic to an F_q[x]-submodule of F_q ⁿ[x], where F_q ⁿ[x] is the ring of polynomials in indeterminate x over F_q ⁿ, an extension field of F_q. Such a module can then be associated with a quasi-cyclic code of index n and block length nL viewed as an F_q[x]-submodule of F_q ⁿ[x]/langx^L-1rang, for any positive integer L. Using this new module approach algebraic lower bounds on the free distance of a convolutional code are derived which can be read directly from the choice of polynomial generators. Links between convolutional codes and cyclic codes over the field extension F_q ⁿ are also developed and Bose-Chaudhuri-Hocquenghem (BCH)-type results are easily established in this setting. Techniques to find the optimal choice of the parameter L are outlined     

The weights of the orthogonals of the extended quadratic binaryGoppa codes

Starting from results on elliptic curves and Kloosterman sums over the finite field GE(2^t), the authors determine the weights of the orthogonals of some binary linear codes; the Melas code of length, the irreducible cyclic binary code of length 2^t+1, and the extended binary Goppa codes defined by polynomials of degree two     

Quasi-cyclic codes over Z4 and some new binarycodes

Previously, (linear) codes over Z₄ and quasi-cyclic (QC) codes (over fields) have been shown to yield useful results in coding theory. Combining these two ideas we study Z ₄-QC codes and obtain new binary codes using the usual Gray map. Among the new codes, the lift of the famous Golay code to Z₄ produces a new binary code, a (92, 2²⁴, 28)-code, which is the best among all binary codes (linear or nonlinear). Moreover, we characterize cyclic codes corresponding to free modules in terms of their generator polynomials     

Cyclic codes and self-dual codes over F2+uF2

We introduce linear cyclic codes over the ring F₂+uF ₂={0,1,u,u¯=u+1}, where u²=0 and study them by analogy with the Z₄ case. We give the structure of these codes on this new alphabet. Self-dual codes of odd length exist as in the case of Z₄-codes. Unlike the Z₄ case, here free codes are not interesting. Some nonfree codes give rise to optimal binary linear codes and extremal self-dual codes through a linear Gray map     

On quasi-cyclic codes with rate l m (Corresp.)

An integer linear programming problem and an additional divisibility condition are described such that they have a common solution if and only if there is a quasi-cyclic code with rate1/m. A table of binary quasi-cyclic codes with dimensions seven and eight and rate1/mfor smallmis included. In particular, there are binary linear codes with (length, dimension, minimum distance)=(35, 7,16), (42, 7,19), (80, 8, 37), (96, 8, 46), and(112,8,54).     

A 2-adic approach to the analysis of cyclic codes

This paper describes how 2-adic numbers can be used to analyze the structure of binary cyclic codes and of cyclic codes defined over Z _2(a), a⩾2, the ring of integers modulo 2^a. It provides a 2-adic proof of a theorem of McEliece that characterizes the possible Hamming weights that can appear in a binary cyclic code. A generalization of this theorem is derived that applies to cyclic codes over Z_2(a) that are obtained from binary cyclic codes by a sequence of Hensel lifts. This generalization characterizes the number of times a residue modulo 2^a appears as a component of an arbitrary codeword in the cyclic code. The limit of the sequence of Hensel lifts is a universal code defined over the 2-adic integers. This code was first introduced by Calderbank and Sloane (1995), and is the main subject of this paper. Binary cyclic codes and cyclic codes over Z_2(a) are obtained from these universal codes by reduction modulo some power of 2. A special case of particular interest is cyclic codes over Z₄ that are obtained from binary cyclic codes by means of a single Hensel lift. The binary images of such codes under the Gray isometry include the Kerdock, Preparata, and Delsart-Goethals codes. These are nonlinear binary codes that contain more codewords than any linear code presently known. Fundamental understanding of the composition of codewords in cyclic codes over Z₄ is central to the search for more families of optimal codes. This paper also constructs even unimodular lattices from the Hensel lift of extended binary cyclic codes that are self-dual with all Hamming weights divisible by 4. The Leech lattice arises in this way as do extremal lattices in dimensions 32 through 48     

环Fp+uFp上的Kerdock码和Preparata码

 Kerdock码和Preparata码是两类著名的二元非线性码,它们比相同条件下的线性码含有更多的码字.Hammons等人在1994年发表的文献中证明了这两类码可视为环Z₄上循环码在Gray映射下的像,从而使得这两类码的编码和译码变得非常简单.环F₂+uF₂是介于环Z₄与域F₄之间的一种四元素环,因此分享了环Z₄与域F₄的一些好的性质,此环上的编码理论研究成为一个新的热点.本文首次将Kerdock码和Preparata码的概念引入到环F_p+uF_p上,证明了它们是一对对偶码;并给出Kerdock码的迹表示;当p=2时,建立了环F₂+uF₂上这两类码与域F₂上的Reed-Muller码之间的联系;并证明了二元一阶Reed-Muller码是环F₂+uF₂上Kerdock码的线性子码的Gray像.