کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
469084 698285 2010 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case
چکیده انگلیسی

This paper presents algorithms for decomposing any zero-dimensional polynomial set into simple sets over an arbitrary finite field, with an associated ideal or zero decomposition. As a key ingredient of these algorithms, we generalize the squarefree decomposition approach for univariate polynomials over a finite field to that over the field product determined by a simple set. As a subprocedure of the generalized squarefree decomposition approach, a method is proposed to extract the ppth root of any element in the field product. Experiments with a preliminary implementation show the effectiveness of our algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 60, Issue 11, December 2010, Pages 2983–2997
نویسندگان
, , ,