Factoring polynomials over Z4 and over certain Galois rings

被引：8
|
作者：
Salagean, A [1 ]
机构：
[1] Univ Loughborough, Dept Comp Sci, Loughborough LE11 3TU, Leics, England
来源：
FINITE FIELDS AND THEIR APPLICATIONS | 2005年 / 11卷 / 01期
关键词：
polynomial factoring; Galois rings; cyclic codes over rings;
D O I：
10.1016/j.ffa.2004.05.001
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is known that univariate polynomials over finite local rings factor uniquely into primary pairwise coprime factors. primary polynomials are not necessarily irreducible. Here we describe a factorisation into irreducible factors for primary polynomials over Z(4) and more generally over Galois rings of characteristic p(2). An algorithm is also given. As an application, we factor x(n) - 1 and x(n) + 1 over such rings. (C) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码：56 / 70
页数：15
相关论文
共 50 条
12345