Object

Title: An algorithm for factoring composite polynomial P(Xp − x − δ)

Co-author(s) :

Kyuregyan Knarik

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:

ITHEA

Date of publication:

2014

Identifier:

oai:noad.sci.am:135919

ISSN:

1310-0513

Language:

English

Journal or Publication Title:

Information Theories and Applications

Volume:

21

Number:

4

URL:


Additional Information:

serj.abrahamyan@gmail.com ; knarikyuregyan@gmail.com

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Object collections:

Last modified:

Mar 2, 2021

In our library since:

Jul 27, 2020

Number of object content hits:

5

All available object's versions:

https://noad.sci.am/publication/149512

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information