环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_(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上长为2~e循环码的Gray象

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

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

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

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

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

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

Z2k--线性负循环码

Wolfmann引进了Z4-负循环码.Zn4上的负移位γ是指Zn4上的满足γ(a0,a1,…,an-1)=(-an-1,a0,a1,…,an-2)的置换;长度为n的Z4-负循环是指Zn4的子集C满足γ(C)=C.他给出了在环Z4[x]/(x2 1)中多项式表示的Z4-负循环码;证明了Z4-线性负循环码Gray映射下的象是二元距离不变量循环码等.本文有两个目的:一是给出在环Z2k[x]/(x2 1)中的多项式表示的Z2k-负循环码及其对偶;二是由Z4-负循环码在Gray映射下的象构造出具有优良关连性质的二元周期序列族.     

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

关于环$Z_4[u]/\langle u2-2\rangle$上的斜多元循环码

本文探索了环$R=Z_4[u]/\langle u2-2\rangle$ 上的几类斜多元循环码和多元循环码. 首先得到了环$R$上$(1,2u)$-多元循环码的生成多项式. 其次由定义的Gray映射得到了环$R$上$(1,2u)$- 多元循环码的Gray像是$Z_4$上的循环码或指数为2的逆循环码. 最后, 通过环$R$上$(1,2u)$- 多元循环码的一些例子来展示本文的主要结果.     

环F2＋uF2上偶长的（1＋u）-常循环码

给出了环F2＋uF2上任意偶长的（1＋u）-常循环码的结构，确定了给定偶长度F2＋uF2上（1＋u）-常循环码的数目．通过Gray映射，得到了F2＋uF2上偶长的（1＋u）-常循环码的二元象．     

有限域上的重根自对偶负循环码

Let F_q be a finite field with q = p~m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap~r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp~r over F_q is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.     

Negacyclic codes over Galois rings of characteristic 2 a

We investigate negacyclic codes over the Galois ring GR(2 a ,m) of length N = 2 k n,where n is odd and k 0.We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR(2 a ,m)[u]/ u 2 k + 1 .Then using a ring isomorphism we obtain the structure of negacyclic codes over GR(2 a ,m) of length N = 2 k n (n odd) and explore the existence of self-dual negacyclic codes over GR(2 a ,m).A bound for the homogeneous distance of such negacyclic codes is also given.     

Symbol-Pair Distances of Repeated-Root Negacyclic Codes of Length 2s over Galois Rings

Negacyclic codes of length 2s over the Galois ring GR(2a,m) are linearly ordered under set-theoretic inclusion,i.e.,they are the ideals <(x + 1)i>,0 ≤ i ≤ 2sa,of the chain ring GR(2a,m)[x]/.This structure is used to obtain the symbol-pair distances of all such negacyclic codes.Among others,for the special case when the alphabet is the finite field F2m (i.e.,a =1),the symbol-pair distance distribution of constacyclic codes over F2m verifies the Singleton bound for such symbol-pair codes,and provides all maximum distance separable symbol-pair constacyclic codes of length 2s over F2m.     

Z4上偶长度的LCD负循环码

线性互补对偶(LCD)码是一类重要的纠错码,在通信系统、数据存储以及密码等领域都有重要的应用.文章研究了整数模4的剩余类环Z₄上偶长度的LCD负循环码,给出了这类码的生成多项式,证明了这类码是自由可逆码;并且利用Z₄上偶长度负循环码构造了一类Lee距离至少为6的LCD码.     

A class of negacyclic BCH codes and its application to quantum codes

In this paper, we study negacyclic BCH codes over \(\mathbb {F}_{q}\) of length \(n=(q^{2m}-1)/(q-1)\), where q is an odd prime power and m is a positive integer. In particular, the dimension, the minimum distance and the weight distribution of some negacyclic BCH codes over \(\mathbb {F}_{q}\) of length \(n=(q^{2m}-1)/(q-1)\) are determined. Two classes of negacyclic BCH codes meeting the Griesmer bound are obtained. As an application, we construct quantum codes with good parameters from this class of negacyclic BCH 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 nonexistence of near-extremal formally self-dual codes

A code is called formally self-dual if and have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over , and . These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally self-dual (f.s.d.) codes. With Zhang’s systematic approach, we determine possible lengths for which the four types of near-extremal formally self-dual codes as well as the two types of near-extremal formally self-dual additive codes cannot exist. In particular, our result on the nonexistence of near-extremal binary f.s.d. even codes of any even length n completes all the cases since only the case 8|n was dealt with by Han and Lee.      

Weights modulo p e of linear codes over rings

In this paper we look at linear codes over the Galois ring $GR(p^{\ell}, m)$ with the homogeneous weight and we prove that the number of codewords with homogenous weights in a particular residue class modulo p ^e are divisible by high powers of p. We also state a result for a more generalized weight on linear codes over Galois rings. We obtain similar results for the Lee weights of linear codes over $\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ and we prove that the results we obtain are best possible. The results that we obtain are an improvement to Wilson’s results in [Wilson RM (2003) In: Proceedings of international workshop on Cambridge linear algebra and graph coloring]     

有限链环上循环码与负循环码的生成多项式

从另一种角度研究了有限链环上循环码.给出了这种环上循环码的构造由这种构造得到了有限链环上的循环码的生成多项式.借助有限链环上循环码与负循环码的同构,也得到了这种环上循环码的生成元.