有限域上长为2mpn 的负循环码

设F_q 是奇数阶有限域. 本文主要借助X^2mpn+1 在F_q 上的不可约因式分解来确定有限域F_q上所有长为2^mpⁿ 的负循环码和自对偶的负循环码的生成多项式, 这里p 是q-1 的奇素因子, m 和n是正整数.     

有限域上一类负循环码

设F_q为一个阶为q的有限域,其中q为奇数.本文研究了x~n+1在F_q上的不可约分解及环F_q[x]/x~n+1中所有本原幂等元,这里的n是素因子整除q-1的某些正整数.进一步,得到了F_q上所有长度为n的不可约负循环码的检验多项式及极小汉明距离.     

关于Bernoulli-Goss多项式的一些注记

Goss和冯克勤证明了:对q≥2,F_q[T]中存在无穷多不正规的不可约多项式。Ireland和Small给出了第n个Bernoulli-Goss多项式(1≤n≤p²—1)的明确表达式,利用这个结果,他们对于3≤p≤269求出所有形为T²—a(a∈F_P[T])的正规二次不可约多项式。本文对n有两项q-adic展开的情形,给出F_q[T]中第n个Bernoulli-Goss多项式的明确表达式。由此证明了:对任意q≥3,F_q[T]中存在无穷多不可约多项式同时是第一类和第二类不正规的,我们还给出二次不可约多项式正规性的一些等价条件。基于文献[3]中的计算结果,我们决定出特征不超过269的所有F_q[T]中二次正规不可约多项式。     

特征标高度为0具有例外权的不可约H(2r,n)-模

本文主要利用广义限制李代数的概念研究不可约H(2r,n)-模,确定了特征标高度为0,并且具有例外权(-w)k(k=0,1,2,…,r)的极大向量的不可约H(2r,n)-模.     

自共轭互反多项式的推广

文章给出有限域F_(q~2)上x~(q~(n+1))-λ的分解和首一不可约λ-自共轭互反多项式的计数公式,其中q是素数方幂,λ∈F_q~*.进一步,得到了F_(q~2)上x~n+1的自共轭互反多项式因子的计数公式.将此公式应用在负循环码上,F_(q~2)上厄米特互补对偶负循环码的个数也被确定.     

环Fpm[u]/<ua>上一类常循环码

本文研究有限链环上一类λ-常循环码.利用x~n-1在R_a[x]上可唯一分解为两两互素的首一基本不可约多项式乘积,刻画了R_a中长为p~sn的所有λ-常循环码,推广了开晓山等人在文献[4]中的结果.     

特征数p的代数闭域上不可约概齐次空间的分类(Ⅰ)

当基域 K 是特征数 p>2的代数闭域时,本文给出了满足条件 dimG≥dim V 的不可约被约三元组的分类.为以后的不可约概齐次向量空间的分类作好准备.由于不可约表示的 Weyl维数公式不再适用,因此我们利用在 Weyl 群作用下的权轨道对不可约模的维数作出估计.最后还得到了3个在特征数0的情形并不存在的新类:即(GL(n),(1+p~8)Δ_1,V(n~2))(s>0),n≥2),(GL(n),∧_1+ρ~3∧_(n-1),V(n~2))(s>0,n≥3)及(GL(4),∧_1+∧_2,V(16))(p=3).     

环IF_pm[u]/〈u~a〉上一类常循环码

本文研究有限链环上一类λ-常循环码.利用x~n-1在R_a[x]上可唯一分解为两两互素的首一基本不可约多项式乘积,刻画了R_a中长为p~sn的所有λ-常循环码,推广了开晓山等人在文献[4]中的结果.     

乘积的平方性

本文证明了乘积 (f(x)=ax²+bx+c∈Z[x]是二次不可约多项式)在n充分大时不是平方数.       

具有两个非零点循环码的权重分布

循环码作为一类重要的线性码,因其有效的编码和译码算法而被广泛应用于通信和存储系统.令F_r为有限域F_q的一个扩域,其中r=q~m,α为有限域F_r的本原元.设n=n1n2满足gcd(n1,n2)=1为r-1的因子.定义F_q上的一类循环码C={c(a1,a2)=(T_r/q(a1y_1~2+a2(g1g2)~i))_(i=0)~(n-1):a1,a2∈F_r},其中g1=α(r-1)/(n1),g2=α(r-1)/(n2),且g1与g1g2不共轭.本文将利用Gauss周期刻画循环码C的权重分布.特别地,这类循环码包含一类二重循环码和一类三重循环码.     

All Two-Weight Irreducible Cyclic Codes?

The aim of this paper is the classification of two-weight irreducible cyclic codes. Using Fourier transforms and Gauss sums, we obtain necessary and sufficient numerical conditions for an irreducible cyclic code to have at most two weights. This gives a unified explanation for all two-weight irreducible cyclic codes and allows a conjecturally complete classification. Aside from the two known infinite families of two-weight irreducible cyclic codes, a computer search reveals 11 sporadic examples. We conjecture that these are already all two-weight irreducible cyclic codes and give a partial proof of our conjecture conditionally on GRH.     

Hamming weights in irreducible cyclic codes

The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes.     

Projective two-weight irreducible cyclic and constacyclic codes

After several remarks on two-weight irreducible cyclic codes, we introduce a family of projective two-weight cyclic codes and a family of projective two-weight constacyclic codes and we discuss the existence of such codes.     

New classes of 2-weight cyclic codes

We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes      

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and cryptography. In particular, cyclic codes having three nonzero weights have been studied by several authors, however, most of these efforts focused on cyclic codes over a prime field. In this work we present a characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field.     

Linear transformations on codes

This paper studies and classifies linear transformations that connect Hamming distances of codes. These include irreducible linear transformations and their concatenations. Their effect on the Hamming weights of codewords is investigated. Both linear and non-linear codes over fields are considered. We construct optimal linear codes and a family of pure binary quantum codes using these transformations.     

Quaternary quasi-cyclic codes

Quasi-cyclic codes of length mn over Z4 are shown to be equivalent to A-submodules of A^n, where A = Z4[x]/（x^m - 1）. In the case of m being odd, all quasi-cyclic codes are shown to be decomposable into the direct sum of a fixed number of cyclic irreducible A-submodules. Finally the distinct quasi-cyclic codes as well as some specific subclasses are enumerated.     

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

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

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

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