环F2＋uF2上长度为2n（n为奇数）的循环码

研究了环F2＋uF2上长度为2n（n为奇数）的循环码,给出了循环码及其对偶码的生成多项式,以及循环码为自对偶码的充要条件,最后进一步给出了循环码极小Lee重量的一些相关结论     

环F_2+uF_2上长度为2n(n为奇数)的循环码

研究了环F2+uF2上长度为2n(n为奇数)的循环码,给出了循环码及其对偶码的生成多项式,以及循环码为自对偶码的充要条件,最后进一步给出了循环码极小Lee重量的一些相关结论     

环F_q+uF_q+vF_q上的斜循环码和LCD码（英文）

本文研究了环R=F_q+uF_q+vF_q(u~2=u,v~2=v,uv=vu=0)上的斜循环码和LCD码,其中q为素数幂.利用线性码与其对偶码在环R上的分解,得到了环R上斜循环码及其对偶码的生成多项式.最后,讨论了环R与有限域F_q上LCD码的关系,通过环R到域F_q~3的Gray映射,得到了环R上LCD码的Gray像是F_q上的LCD码.     

有限链环上的循环码及其Mattson-Solomn多项式

研究了有限链环上的循环码的结构及其Mattson-Solomn多项式,用循环码的Mattson-Solomn多项式和定义集刻画循环码及其对偶码的性质。     

环F2m+uF2m+u2F2m+u3F2m上线性码及其对偶码的Gray像

本文研究了环F2m+uF2m+u2 Fm+u3F2m上线性码.利用环是Frobenius环,证明了环上线性码C及其自对偶码的Gray像为F2m上的线性码和自对偶码.同时,给出了上循环码C的Gray像ψ(C)为F2m上的拟循环码.     

基于环F4+uF4上的线性码

本文研究了环F4+uF4上线性码的Gray像.利用环F4+uF4为Frobenius环及其元素的一种表示方法,获得了环F4+uF4上自对偶码的Gray像也为自对偶码,及环F4+uF4上循环码的Gray像为拟循环码,推广了环F4+uF4上线性码的Gray像的相关结果.     

有限链环上的常循环码

研究了有限链环R上常循环码的等价性,根据等价性给出了R上一些常循环码及其对偶码的结构.确定了该环上长度为ps的所有常循环码及其对偶码的结构.     

Z_4上偶长度的LCD负循环码

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

环F_p+vF_p上互补对偶常循环码（英文）

本文研究了环F_p+_vF_p上互补对偶(1-2v)-常循环码.利用环F_p+_v F_p上(1-2v)-常循环码的分解式C=_vC_(1-v)⊕(1-v)C_v,得到了环F_p+_v F_p上互补对偶(1-2v)-常循环码的生成多项式.然后借助从F_p+_v F_p到F_p~2的Gray映射,证明了环F_p+_vF_p上互补对偶(1-2v)-常循环码的Gray像是F_p的互补对偶循环码     

Z4上偶长度的LCD负循环码

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

THE BINARY IMAGE OF THE DUAL OF QUATERNARY GOETHALS CODE

IIntroductlonA．Galois ringLet GR(4”)be the Gajois ring of characteristic 4 with 4”elements．In GR(4”)thereexists a nonzero element ’of order 2”一1．Let T＝{0,1,,…,矿－‘};then any elementc e GR(4”)can be writt。unlqllely sc＝a十 Zb,a。 E丁,whi山 is called 2－adic representation ofc．The elemem c can also be written unl叩ely sc＝ac ＋ al卜…＋am矿‘,a;E凤,(0＜6＜。一 1),whi血is called the additive representation of c．It is。11协。n that GR(”)/切。见。,where (2 is the pr…     

Characterizations of some two-dimensional cyclic codes correspond to the ideals of F[x,y]/

Two-dimensional cyclic code is one of the natural generalizations of cyclic code. In this paper we study the algebraic structure of some two-dimensional cyclic codes and their dual codes.     

环$F_2 uF_2 u^2F_2$上的循环码及自对偶码

We give the structures of a cyclic code over ring
R = F2 ＋ uF2 ＋ u^2F2 = {0, 1,u, u^2,v, v^2,uv, v^3},
where u^3 = 0, of odd length and its dual code. For the cyclic code, necessary and sufficient conditions for the existence of self-dual code are provided.     

四元Goethals码的对偶码

Abstract. The trace representation of the dual of quaternary Goethals code δ(m) is given . It isproved that the shortened code of δ(m) is cyclic and its generators are shown.     

基于广义\mbox{\boldmath $Z_{4}$}线性Calderbank-McGuire码的对偶

本文讨论了广义Z4线性Calderbank-McGuire码的对偶的迹表示及2-adic表示, 同时给出了其最小Lee权估计.     

A generalization of the BCH bound for cyclic codes,including the Hartmann-Tzeng bound

In this paper it is shown that both the BCH bound and the Hartmann-Tzeng bound for the minimum distance of a cyclic code can be obtained quite easily as consequences of an elementary result concerning the defining set of its zeros.     

Relative generalized Hamming weights of cyclic codes

Relative generalized Hamming weights (RGHWs) of a linear code with respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the linear codes. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems. In this paper, we investigate the RGHWs of cyclic codes of two nonzeros with respect to its irreducible cyclic subcodes. We give two formulae for RGHWs of the cyclic codes. As applications of the formulae, explicit examples are computed. Moreover, RGHWs of cyclic codes in the examples are very large, comparing with the generalized Plotkin bound of RGHWs. So it guarantees very high security for the secret sharing scheme based on the dual codes.     

A class of generalized cyclic codes

1. IntroductionPrange was considered to be first person to study cyclic codes at the end of 1950s, seeIll and [2]. Since then, cyclic codes are the mostly studied of all codes, because they are easyto encode, and include an important family of BCH codes. A code C is cyclic if it is linearand if any cyclic shift of a codeword is also a codeword, i.e., whenever (co, of,' 1 on--l ) is inC then so is (c.--1, co j', c.--2). In fact, one could define a cyclic code to be an ideal in thering of…     

A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays

In (Can J Math 51(2):326–346, 1999), Martin and Stinson provide a generalized MacWilliams identity for linear ordered orthogonal arrays and linear ordered codes (introduced by Rosenbloom and Tsfasman (Prob Inform Transm 33(1):45–52, 1997) as “codes for the m-metric”) using association schemes. We give an elementary proof of this generalized MacWilliams identity using group characters and use it to derive an explicit formula for the dual type distribution of a linear ordered code or orthogonal array.