环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上的线性准循环码.     

环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+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-准循环码.     

环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上的准循环码.     

Zpk+1环上的循环码的Gray像

定义了Znpk+1到Znpkp的Gray映射,给出该映射的一个性质,证明了Zpk+1环上码长为n的码为循环码的充要条件是它的Gray像是Zp上长度为npk指数为pk的准循环码.     

关于环F_(p~m)+uF_(p~m)+ u~2F_(p~m)上循环码的注记（英文）

本文研究了环F_(p~m)+uF_(p~m)+ u~2F_(p~m)上长度为p~s的循环码分类.通过建立环F_(p~m)+uF_(p~m)+ u~2F_(p~m)到环F_(p~m)+uF_(p~m)的同态,给出了环F_(p~m)+uF_(p~m)+ u~2F_(p~m)上长度为p~s的循环码的新分类方法.应用这种方法,得到了环F_(p~m)+uF_(p~m)+ u~2F_(p~m)长度为p~s的循环码的码词数.     

环F_2+uF_2+u~2F_2上循环码的Gray距离

定义了环R=F2+uF2+u2 F2(u3=0)到F32的一个新的Gray映射.首先介绍环R上奇长度的循环码的挠码,给出了各阶挠码的生成多项式.利用一阶挠码与二阶挠码确立了R上奇长度的循环码的Gray距离.     

环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象的汉明距离.     

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

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

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

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

环F_2+uF_2+u~2F_2上线性码的MacWilliams恒等式

记R=F_2+uF_2+u~2F_2,定义了环R上码字的李重量分布的概念,构造了从R~n到F_2~(3n)的Gray映射φ.通过对环R上线性码及其对偶码生成矩阵的研究,证明了环R上线性码及其对偶码的Gray象是F_2上的对偶码.利用域F_2上线性码及其对偶码的重量分布关系,得到了环R上线性码及其对偶码关于李重量分布的MacWilliams恒等式.     

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.     

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

Quasi-cyclic codes as cyclic codes over a family of local rings

We give an algebraic structure for a large family of binary quasi-cyclic codes. We construct a family of commutative rings and a canonical Gray map such that cyclic codes over this family of rings produce quasi-cyclic codes of arbitrary index in the Hamming space via the Gray map. We use the Gray map to produce optimal linear codes that are quasi-cyclic.     

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 codes over <Emphasis Type="Italic">R</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>

Cyclic codes over an infinite family of rings are defined. The general properties of cyclic codes over these rings are studied, in particular nontrivial one-generator cyclic codes are characterized. It is also proved that the binary images of cyclic codes over these rings under the natural Gray map are binary quasi-cyclic codes of index 2 ^k . Further, several optimal or near optimal binary codes are obtained from cyclic codes over R _k via this map.