环F_p+vF_p上的v-常循环码及其Gray象

定义了F_p+vF_p到F~2_p的Gray映射,其中v~2=1,证明了F_p+vF_p上长为n的v-常循环码在定义的Gray映射下的象是F_p上长为2n的距离不变的线性循环码,并进一步定义了F_p+vF_p上的广义Gray象,证明了其上线性码的广义Gray象是F_p上距离不变的线性码、循环码的广义Gray象是F_p上长为4n的4-准循环码.     

环Z_p[u]/(u~(k+1))上循环码的Gray象

记R=Z_p[u]/(u~(k+1)),定义了从R~n到Z_p~(np~k)的Gray映射.利用Gray映射的性质,研究了环R上任意长循环码.证明了环R上任意长码是循环码当且仅当它的Gray象是域Z_p上的准循环码.特别的,环R上的线性循环码的Gray象是Z_p上的线性准循环码.     

环F_(p~k)+uF_(p~k)+u~2F_(p~k)上码是循环码的一个充分必要条件

记环R=F_p~k+uF_p~k+u~2F_p~k,定义了一个从R~n到F_p~k~(2np~k)的Gray映射.利用Gray映射的性质,研究了环R上任意长循环码.证明了环R上任意长码是循环码当且仅当它的Gray象是F_p~k上的准循环码.特别的,环R上的线性循环码的Gray象是F_p~k上的线性准循环码.     

环F_2+uF_2上长为2~e循环码的Gray象

利用环F2+uF2上长为2e的循环码结构,证明了这样的循环码的一类码在Gray映射下的象是循环码,并给出了环F2+uF2上长为2e的循环码的Gray象仍是循环码的一个充要条件.     

环F_p+uF_p+vF_p+uvF_p上的循环码

讨论了非有限链环R=F_p+uF_p+vF_p+uvF_p上的循环码.通过环R上的循环码与多项式环R_n=(F_p+uF_p+vF_p+uvF_p)[x]/(xⁿ-1)的理想的对应关系及对R_n的研究给出了R上循环码的刻画.最后定义了一个Gray映射,并刻画了F_p+uF_p+vF_p+uvF_p上的循环码在该映射下的像.     

环F_(p~k)+uF_(p~k)+u~2F_(p~k)上的常循环码和循环码

记环R=F_(p~k)+uF_(p~k)+u~2F_(p~k),定义了一个从R~n到F_(p~k)~(2np~k)的Gray映射.利用Gray映射的性质,研究了环R上(1-u~2)-循环码和循环码.证明了环R上码是(1-u~2)-循环码当且仅当它的Gray象是F_(p~k)上的准循环码.当(n,p)=1时,证明了环R上的长为n的线性循环码的Gray象置换等价于域F_(p~k)上的线性准循环码.     

环F_2+uF_2上偶长的(1+u)-常循环码

给出了环F2+uF2上任意偶长的(1+u)-常循环码的结构,确定了给定偶长度F2+uF2上(1+u)-常循环码的数目.通过Gray映射,得到了F2+uF2上偶长的(1+u)-常循环码的二元象.     

环F2+uF2+vF2上线性码广义Gray像

本文定义了环F2+uF2+vF2到域F2的广义Gray映射φ像,研究了环F2+uF2+vF2上线性码的广义Gray像.利用广义Gray映射φ的线性性,证明了环F2+uF2+vF2上线性码C的广义Gray像φ(C)满足dH(C)=dH(φ(C))且φ(C⊥)φ(C)⊥.同时,给出了F2+uF2+vF2上循环码C的广义Gray像φ(C)为F2上的4-拟循环码.     

环F2＋uF2上长为2e循环码的Gray象

利用环F2＋uF2上长为2e的循环码结构,证明了这样的循环码的一类码在Gray映射下的象是循环码,并给出了环F2＋uF2上长为2e的循环码的Gray象仍是循环码的一个充要条件．     

环F_2+uF_2+u~2F_2上线性码的广义Gray像

摘要:引入了环F_2+uF_2+u~2F_2与F_2之间的广义Gray映射,利用环F_2+uF_2+u~2F_2上线性码的生成矩阵得出了广义Gray像φ(C)的生成矩阵,证明了F_2+uF2+u2F2上线性码自正交码的广义Gray像仍为自正交码和F_2+uF_2+u~2F_2上循环码的广义Gray像是F_2上的准循环码.     

Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes

The Goethals code is a binary nonlinear code of length 2^m+1 which has codewords and minimum Hamming distance 8 for any odd . Recently, Hammons et. al. showed that codes with the same weight distribution can be obtained via the Gray map from a linear code over Z ₄of length 2^m and Lee distance 8. The Gray map of the dual of the corresponding Z ₄ code is a Delsarte-Goethals code. We construct codes over Z ₄ such that their Gray maps lead to codes with the same weight distribution as the Goethals codes and the Delsarte-Goethals codes.     

$$\mathbb {Z}_{4}$$-codes and their Gray map images as orthogonal arrays

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over \(\mathbb {Z}_{4}\) and their (usually non-linear) binary Gray map images. We show that Delsarte’s observation extends to codes over arbitrary finite commutative rings with identity. Also, we show that the strength of the Gray map image of a \(\mathbb {Z}_{4}\) code is one less than the minimum Lee weight of its Gray map image.     

The Gray images of $$$$ constacyclic codes over $$F_{2^m}[u]/\langle u^{k} \rangle $$F2m[u]/⟨uk⟩

Let \(R_{k}\) denote the polynomial residue ring \(F_{2^m}[u]/\langle u^{k} \rangle \), where \(2^{j-1}+1\le k\le 2^{j}\) for some positive integer \(j\). Motivated by the work in [1], we introduce a new Gray map from \(R_{k}\) to \(F_{2^m}^{2^{j}}\). It is proved that the Gray image of a linear \((1+u)\) constacyclic code of an arbitrary length \(N\) over \(R_{k}\) is a distance invariant linear cyclic code of length \(2^{j}N\) over \(F_{2^m}\). Moreover, the generator polynomial of the Gray image of such a constacyclic code is determined, and some optimal linear cyclic codes over \(F_{2}\) and \(F_{4}\) are constructed under this Gray map.     

Some results on linear codes over the ring $$\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4$$

In this paper, we mainly study the theory of linear codes over the ring \(R =\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4\). By using the Chinese Remainder Theorem, we prove that R is isomorphic to a direct sum of four rings. We define a Gray map \(\Phi \) from \(R^{n}\) to \(\mathbb {Z}_4^{4n}\), which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over \(\mathbb {Z}_4\). We also discuss some properties of MDS codes over R. Furthermore, we study the MacWilliams identities of linear codes over R and give the generator polynomials of cyclic codes over R.     

Cyclic DNA codes over the ring $$\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2$$

We study the structure of cyclic DNA codes of odd length over the finite commutative ring \(R=\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2 + v^2\mathbb {F}_2+uv^2\mathbb {F}_2,~u^2=0, v^3=v\), which plays an important role in genetics, bioengineering and DNA computing. A direct link between the elements of the ring R and 64 codons used in the amino acids of living organisms is established by introducing a Gray map from R to \(R_1=\mathbb {F}_2+u\mathbb {F}_2 ~(u^2=0)\). The reversible and the reversible-complement codes over R are investigated. We also discuss the binary image of the cyclic DNA codes over R. Among others, some examples of DNA codes obtained via Gray map are provided.     

Algebraic-geometry codes, one-point codes, and evaluation codes

One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed–Muller codes. Given an -algebra A, an order function on A and given a surjective -morphism of algebras , the ith evaluation code with respect to is defined as the code . In this work it is shown that under a certain hypothesis on the -algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G _i with associated divisors is the sequence of evaluation codes associated to some -algebra A, some order function and some surjective morphism with if and only if it is a sequence of one-point codes.      

环GR(4,2)上一类负循环码的Gray象

研究了GR(4,2)上长为2~s的负循环码的Gray象,证明了GR(4,2)上长为2~s的负循环码的Gray象是F_4上长为2~(s+2)指数为2的准循环码.通过计算GR(2~a,m)上长为2~s的负循环码的齐次距离,确定了GR(4,2)上长为2~s的负循环码的Gray象的汉明距离.