Object
Title: An algorithm for factoring composite polynomial P(Xp − x − δ)
Co-author(s) :
Abstract:
Let P(x) = xn + an−1x n−1 + .... + a1x + a0 be an irreducible polynomial over Fq. In [Cao, 2012, Varshamov, 1973, Lidl, 1987] the factorization of the composite polynomial P(x p − ax − δ), when a = 1 and T rFq/Fp (nb − an−1) = 0 is considered. The result of factorization of polynomial P(x p − x − δ) is a p irreducible polynomials of degree n over Fq. In this paper we propose an algorithm for factoring composite polynomial P(x p − x − δ) over Fq and give a explicit view of each factor.
Publisher:
Date of publication:
Identifier:
oai:noad.sci.am:135919
ISSN:
Language:
Journal or Publication Title:
Information Theories and Applications
Volume:
Number:
URL:
Additional Information:
serj.abrahamyan@gmail.com ; knarikyuregyan@gmail.com
Affiliation:
Institute for Informatics and Automation Problems of NAS RA
Country:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
May 3, 2021
In our library since:
Jul 27, 2020
Number of object content hits:
29
All available object's versions:
https://noad.sci.am/publication/149512
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| An algorithm for factoring composite polynomial P(Xp − x − δ) | May 3, 2021 |
