• 호남수학학술지
• /
• 제33권3호
• /
• pp.355-366
• /
• 2011

In this paper we investigate criteria that for an irreducible monic quadratic polynomial f(x) ${\in}$ $\mathbb{Q}$[x], $f{\circ}g$ is reducible over $\mathbb{Q}$ for an irreducible polynomial g(x) ${\in}$ $\mathbb{Q}$[x]. Odoni intrigued the discussion about an explicit form of irreducible polynomials f(x) such that $f{\cric}f$ is reducible. We construct a system of infitely many such polynomials.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.741-744
• /
• 1999

In this paper, We represent a low complexity of parallel canonical basis multiplier for GF( q$^{n}$ ), ( q＞ 2). The Mastrovito multiplier is investigated and applied to multiplication in GF(q$^{n}$ ), GF(q$^{n}$ ) is different with GF(2$^{n}$ ), when MVL is applied to finite field. If q is larger than 2, inverse should be considered. Optimized irreducible polynomial can reduce number of operation. In this paper we describe a method for choosing optimized irreducible polynomial and modularizing recursive polynomial operation. A optimized irreducible polynomial is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(q$^{n}$ ) with low gate counts. and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.

• 충청수학회지
• /
• 제32권2호
• /
• pp.171-177
• /
• 2019

We associate a positive integer n and a subgroup H of the group G(n) with a polynomial $J_{n,H}(x)$, which is called the Galois polynomial. It turns out that $J_{n,H}(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$.

• 대한수학회논문집
• /
• 제32권1호
• /
• pp.1-6
• /
• 2017

In this paper, the fundamental theorem of Galois Theory is used to generalize cyclotomic polynomials and construct irreducible polynomials associated with the n-th primitive roots of unity.

• 대한수학회논문집
• /
• 제22권2호
• /
• pp.183-194
• /
• 2007

For an irreducible binomial polynomial $f(x)=x^n-b{\in}K[x]$ with a field K, we ask when does the mth iteration $f_m$ is irreducible but $m+1th\;f_{m+1}$ is reducible over K. Let S(n, m) be the set of b's such that $f_m$ is irreducible but $f_{m+1}$ is reducible over K. We investigate the set S(n, m) by taking K as the rational number field.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.1017-1023
• /
• 2010

We prove that a maximal ideal M of D[x] has two generators and is of the form where p is an irreducible element in a PID D having infinitely many nonassociate irreducible elements and q(x) is an irreducible non-constant polynomial in D[x]. Moreover, we find how minimal generators of maximal ideals of a polynomial ring D[x] over a DVR D consist of and how many generators those maximal ideals have.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 V
• /
• pp.2617-2620
• /
• 2003

This paper presents the construction algorithm of the irreducible polynomial which needs to multiply over GF(2$\^$m/) and the flow chart representing the proposed algorithm has been proposed. And also, we get the degree from the value of xm＋k formation to the value of k = 7 using the proposed flow chart. The multiplier circuit has been implemented by using the proposed irreducible polynomial generation(IPG) algorithm in this paper, and we compared the proposed circuit with the conventional one. In the case of k = 7, one AND gate and five Ex-or gates are needed as the delay time for the irreducible polynomial in the proposed algorithm, but seven AND gates and sever Ex-or gates in the conventional one. As a result, the proposed algorithm shows the improved performance on the delay time.

• 대한수학회지
• /
• 제47권1호
• /
• pp.101-112
• /
• 2010

In [3] we showed that a polynomial over a Noetherian ring is divisible by some other polynomial by looking at the matrix formed by the coefficients of the polynomials which we called the resultant matrix. In this paper, we consider the polynomials with coefficients in a field and divisibility of a polynomial by a polynomial with a certain degree is equivalent to the existence of common solution to a system of Diophantine equations. As an application we construct a family of irreducible quartics over $\mathbb{Q}$ which are not of Eisenstein type.

• 호남수학학술지
• /
• 제37권4호
• /
• pp.469-472
• /
• 2015

The n-th cyclotomic polynomial ${\Phi}_n(x)$ is irreducible over $\mathbb{Q}$ and has integer coefficients. The degree of ${\Phi}_n(x)$ is ${\varphi}(n)$, where ${\varphi}(n)$ is the Euler Phi-function. In this paper, we define Semi-Cyclotomic Polynomial $J_n(x)$. $J_n(x)$ is also irreducible over $\mathbb{Q}$ and has integer coefficients. But the degree of $J_n(x)$ is $\frac{{\varphi}(n)}{2}$. Galois Theory will be used to prove the above properties of $J_n(x)$.

• 호남수학학술지
• /
• 제39권2호
• /
• pp.259-265
• /
• 2017

Galois polynomials are defined as a generalization of the Cyclotomic polynomials. Galois polynomials have integer coefficients as the cyclotomic polynomials. But they are not always irreducible. In this paper, Galois polynomials are partly classified according to the type of subgroups which defines the Galois polynomial.