关于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]中二次正规不可约多项式。     

决定类数为一的(2,2,…,2)型代数函数域

设k=F_q(t)为F_q上以t为变元的有理函数域,F_q为q元域,特征不是2。设L=k(√D₁,…,√D_n~(1/2))是k的2ⁿ次扩张,常数域为F_q,D_i∈F_q[t],n>1。本文证明了:(1)除子类数为1的域L恰为k(√P₁,√P₂)和k(√P₁P₂,√P₁P₃),其中P_i∈F_q[t]为互异一次多项式。(2)理想类数为1的虚域L=k(√D₁,√D₂)(即L的整数环是唯一析因环)必是D₁=t;而D₂=t³-t-1(q=3),t²-t-1(q=3),t~2+2(q=5),或t+c,c∈F_q(或其在变换下的变形)。     

确定广义Reed-Solomon码的深洞树及其应用

深洞在广义Reed-Solomon码译码中有重要的作用.本文研究广义Reed-Solomon码的深洞树及其应用.首先,基于Newton插值对广义Reed-Solomon码的期望深洞树给出了一个显式的刻画.然后,应用期望深洞树的结论给出一个限制和集的结果.     

关于本原射影Reed-Solomon码的深洞

本原射影Reed-Solomon码是数字通信领域中的一类重要的极大距离可分码.在本原射影ReedSolomon码的译码过程中,人们通常采用极大似然译码算法.对于一个收到的向量u∈F_q~n,极大似然译码算法关键在于确定向量u关于码C的错误距离d(u,C).熟知d(u,C)≤ρ(C),其中ρ(C)为码C的覆盖半径.若d(u,C)=ρ(C),则称u为码C的深洞.本文得到了本原射影Reed-Solomon码PPRS_q(F_q~*,k)的一类深洞.实际上,利用有限域F_q上极大距离可分码的生成矩阵,本文证明如下结果成立:如果q≥4,整数k满足2≤k≤q-2,收到的向量u的前q-1个分量的Lagrange插值多项式为u(x)=λx~(q-2)+f≤k-2(x),其中λ∈F_q~*,f≤k-2(x)为F_q上次数不超过k-2的多项式,并且u的第q个分量为0,那么u是本原射影Reed-Solomon码PPRSq(F_q~*,k)的一个深洞.     

基于代数曲线上具有高广义联合线性复杂度的多重序列

多重序列的联合线性复杂度是衡量基于字的流密码体系安全的一个重要指标. 由元素取自F_q上的m 重序列和元素取自F_q^m 上的单个序列之间的一一对应, Meidl 和Özbudak 定义多重序列的广义联合线性复杂度为对应的单个序列的线性复杂度. 在本文中, 我们利用代数曲线的常数域扩张, 研究两类多重序列的广义联合线性复杂度. 更进一步, 我们指出这两类多重序列同时具有高联合线性复杂度和高广义联合线性复杂度.     

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

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

(2,2,…,2)型代数函数域

本文基于文献[1—4]的有关结果系统地研究了2ⁿ次扩域 L=k(√D₁(t)…,√(D_n(t),D_i(t)∈F_q[t], 特别决定了L/k的分类,素分解规律,整基,判别式,亏格;定义并确定了L/k的导子;确定了L/k的ζ-函数;最后证明了L的理想类数为,L的(零次)除子类数为,其中K_v过L/k的二次子扩张,Q为单位指数,m∈Z明显给出。后两公式的证明涉及较复杂的计算。这些结果是上述关于k的二次扩张结果的推广。基于这些结果及MacRae,Madan的若干结果,我们在相继的论文中确定了h(L)=1的全部域L,以及h(O_L)=1,n=2的全部虚域L。     

一类新的有限域上的置换多项式

本文研究了有限域上置换多项式的构造问题.利用分段方法构造了F_q²上形如（x^q-x+c）^{（k（q2-1））/（d）+1}+x^q+x的置换多项式,其中1≤k < d且d是q-1的任意因子,推广了已有文献中的某些结果.     

群的F-次正规与F-次反正规链

给定一个子群闭的饱和群系F ,定义群类Fpc　 ,使得G ∈F_pc 当且仅当对于每个子群X ≤G ,存在G的一个F 次正规子群S ,X≤S并且X在S中F 次反正规 .借助F投射子和F覆盖子群 ,给出了F_pc群的特征 .     

辛空间的排列问题及具有容错能力的pooling设计的紧界

该文利用辛空间上的子空间构造了一类新的d ^z析取矩阵,然后研究了如下排列问题：对于给定的整数m, r, s,ν, d, q 和辛空间F^2ν _q中的一个(m, s) 型子空间S, 这里ν+s≥ m>r≥2s-1≥1, d≥2,q 是一个素数的幂, 作者从S中找到d个(m-1, s-1) 型子空间H₁,… H_d, 使包含在这些(m-1, s-1) 型子空间中的(r, s-1)型子空间个数达到最大. 然后利用这个排列的有关结论, 给出了一类pooling设计的紧界.     

On deep holes of standard Reed-Solomon codes

Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For the standard Reed-Solomon codes [p-1, k]p with p a prime, Cheng and Murray conjectured in 2007 that there is no other deep holes except the trivial ones. In this paper, we show that this conjecture is not true. In fact, we find a new class of deep holes for standard Reed-Solomon codes [q-1, k]q with q a power of the prime p. Let q≥4 and 2≤k≤q-2. We show that the received word u is a deep hole if its Lagrange interpolation polynomial is the sum of monomial of degree q-2 and a polynomial of degree at most k-1. So there are at least 2(q-1)qk deep holes if k q-3.     

On Ordinary Words of Standard Reed-Solomon Codes over Finite Fields

Reed-Solomon codes are widely used to establish a reliable channel to transmit information in digital communication which has a strong error correction capability and a variety of efficient decoding algorithm.Usually we use the maximum likelihood decoding(MLD) algorithm in the decoding process of Reed-Solomon codes.MLD algorithm relies on determining the error distance of received word.Dür,Guruswami,Wan,Li,Hong,Wu,Yue and Zhu et al.got some results on the error distance.For the Reed-Solomon code C,the received word u is called an ordinary word of C if the error distance d(u,C) =n-deg u(x) with u(x) being the Lagrange interpolation polynomial of u.We introduce a new method of studying the ordinary words.In fact,we make use of the result obtained by Y.C.Xu and S.F.Hong on the decomposition of certain polynomials over the finite field to determine all the ordinary words of the standard Reed-Solomon codes over the finite field of q elements.This completely answers an open problem raised by Li and Wan in[On the subset sum problem over finite fields,Finite Fields Appl.14 (2008) 911-929].     

Counting polynomials over finite fields with prescribed leading coefficients and linear factors

We count the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This is equivalent to counting codewords in Reed-Solomon codes which are at a certain distance from a received word. We first apply the generating function approach, which is recently developed by the author and collaborators, to derive expressions for the number of monic polynomials with prescribed leading coefficients and linear factors. We then apply Li and Wan's sieve formula to simplify the expressions in some special cases. Our results extend and improve some recent results by Li and Wan, and Zhou, Wang and Wang.     

Construction of MDS Self-dual Codes over Finite Fields

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For finite field with odd characteristic and square cardinality, our results can produce more classes of MDS self-dual codes than previous works.     

On Reed-Solomon Codes

The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, Li and Wan showed that the error distance can be determined when the degree of the received word as a polynomial is small. In the first part, the result of Li and Wan is improved. On the other hand, one of the important parameters of an error-correcting code is the dimension. In most cases, one can only get bounds for the dimension. In the second part, a formula for the dimension of the generalized trace Reed-Solomon codes in some cases is obtained.     

On explicit factors of cyclotomic polynomials over finite fields

We study the explicit factorization of 2 ⁿ r-th cyclotomic polynomials over finite field \mathbbF_q{\mathbb{F}_q} where q, r are odd with (r, q) = 1. We show that all irreducible factors of 2 ⁿ r-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of 2 ⁿ 5-th cyclotomic polynomials over finite fields and construct several classes of irreducible polynomials of degree 2 ^n–2 with fewer than 5 terms.     

Permutation polynomials over finite fields from a powerful lemma

Using a lemma proved by Akbary, Ghioca, and Wang, we derive several theorems on permutation polynomials over finite fields. These theorems give not only a unified treatment of some earlier constructions of permutation polynomials, but also new specific permutation polynomials over Fq. A number of earlier theorems and constructions of permutation polynomials are generalized. The results presented in this paper demonstrate the power of this lemma when it is employed together with other techniques.     

On the constructions of MDS self-dual codes via cyclotomy

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual codes with new length by using generalized Reed-Solomon codes and extended generalized Reed-Solomon codes as the candidates of MDS codes and taking their evaluation sets as a union of cyclotomic classes. The conditions on such MDS codes being self-dual are expressed in terms of cyclotomic numbers.     

Fq-linear Cyclic Codes over $$ F{_q^m}$$ : D FT Approach

Codes over that are closed under addition, and multiplication with elements from F_q are called F_q-linear codes over . For m 1, this class of codes is a subclass of nonlinear codes. Among F_q-linear codes, we consider only cyclic codes and call them F_q-linear cyclic codes (F_q LC codes) over The class of F_q LC codes includes as special cases (i) group cyclic codes over elementary abelian groups (q=p, a prime), (ii) subspace subcodes of Reed–Solomon codes (n=q^m–1) studied by Hattori, McEliece and Solomon, (iii) linear cyclic codes over F_q (m=1) and (iv) twisted BCH codes. Moreover, with respect to any particular F_q-basis of , any F_qLC code over can be viewed as an m-quasi-cyclic code of length mn over F_q. In this correspondence, we obtain transform domain characterization of F_q LC codes, using Discrete Fourier Transform (DFT) over an extension field of The characterization is in terms of any decomposition of the code into certain subcodes and linearized polynomials over . We show how one can use this transform domain characterization to obtain a minimum distance bound for the corresponding quasi-cyclic code. We also prove nonexistence of self dual F_q LC codes and self dual quasi-cyclic codes of certain parameters using the transform domain characterization.AMS classification 94B05