Explicit factorization of X2mpn-1 over a finite field

被引:23
|
作者
Chen, Bocong [1 ]
Li, Liangchen [2 ]
Tuerhong, Rouziwanguli [3 ]
机构
[1] Nanyang Technol Univ, Sch Phys & Math Sci, Div Math Sci, Singapore 637616, Singapore
[2] Luoyang Normal Univ, Sch Math Sci, Luoyang 471022, Peoples R China
[3] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Peoples R China
基金
中国国家自然科学基金;
关键词
Irreducible factorization; Cyclic code; Binomial; Trinomial; DICKSON POLYNOMIALS; CYCLIC CODES;
D O I
10.1016/j.ffa.2013.06.002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let F-q be a finite field of odd order q and m, n be positive integers. In this paper, the irreducible factorization of X-2m P-n - 1 over Fq is given in a very explicit form, where p is an odd prime divisor of q-1. It is shown that all the irreducible factors of (XPn)-P-2m - 1 over F-q are either binomials or trinomials. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:95 / 104
页数:10
相关论文
共 50 条