SUBSPACES AND POLYNOMIAL FACTORIZATIONS OVER FINITE-FIELDS

被引:7
作者
LEE, TCY [1 ]
VANSTONE, SA [1 ]
机构
[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO,ON N2L 3G1,CANADA
关键词
POLYNOMIAL FACTORIZATION; FINITE FIELDS; FACTOR;
D O I
10.1007/BF01195333
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Recently Niederreiter described a new method for factoring polynomials over finite fields. As with the Berlekamp technique, the method requires the construction of a linear subspace whose dimension is precisely the number of irreducible factors of the polynomial being considered. This paper explores the connection between these subspaces and gives a characterization of other subspaces having properties which are similar.
引用
收藏
页码:147 / 157
页数:11
相关论文
共 3 条
[1]  
BERLEKAMP ER, 1967, BELL SYST TECH J, V46, P1823
[2]   A NEW EFFICIENT FACTORIZATION ALGORITHM FOR POLYNOMIALS OVER SMALL FINITE-FIELDS [J].
NIEDERREITER, H .
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1993, 4 (02) :81-87
[3]  
NIEDERREITER H, IN PRESS LINEAR ALGE