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...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.展开更多
For any odd prime p, a classification of all cyclic and negacyclic codes of length 8ps over Fpm are obtained, which establishes the algebra structures in term of specified polynomial generators of such codes. Among ot...For any odd prime p, a classification of all cyclic and negacyclic codes of length 8ps over Fpm are obtained, which establishes the algebra structures in term of specified polynomial generators of such codes. Among other results, all self-dual negacyclic codes of length 8ps are obtained, and the structures of α-constacyclic and β-constacyclic codes of length 8ps over Fpm are established.展开更多
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese...In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.展开更多
基金Supported by Reward Fund for Outstanding Young and Middle-Aged Scientists of Shandong Province(Grant No.BS2011DX011)Qingdao Postdoctoral Fund(Grant No.861605040007)
文摘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.
基金Supported by the Natural Science Foundation of Hubei Province(D20144401)the Natural Science Foundation of Hubei Polytechnic University(12xjz14A)
文摘For any odd prime p, a classification of all cyclic and negacyclic codes of length 8ps over Fpm are obtained, which establishes the algebra structures in term of specified polynomial generators of such codes. Among other results, all self-dual negacyclic codes of length 8ps are obtained, and the structures of α-constacyclic and β-constacyclic codes of length 8ps over Fpm are established.
基金supported by the Natural ScienceFoundation of Hubei Province(D2014401)the Natural Science Foundation of Hubei Polytechnic University(12xjz14A)
文摘In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.
