• Bulletin of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.609-616
• /
• 2005

In this paper we show that we can extend the purity of left R-modules to the case of polynomial modules, bipolynomial modules, and also inverse polynomial modules.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.105-110
• /
• 2005

The linearized polynomial fan be regarded as a generalization of the identity function so that the inverse of the linearized polynomial is a generalization of e inverse function. Since the inverse function has so many good cryptographic properties, the inverse of the linearized polynomial is also a candidate of good Boolean functions. In particular, a construction method of vector resilient functions with high algebraic degree was proposed at Crypto 2001. But the analysis about the algebraic degree of the inverse of the linearized Polynomial. Hence we correct the inexact result and give the exact maximal algebraic degree.

• East Asian mathematical journal
• /
• v.21 no.1
• /
• pp.105-112
• /
• 2005

In this paper we show that we can extend the purity extension properties of left R-modules to the various generalized inverse polynomial modules.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.38-38
• /
• 2000

To fulfill recent requirements for high quality products in steel rolling process, fast responding and easily tunab control system is required and ILQ(Inverse Linear Quadratic) control system may be one of such alternatives. In this paper characteristics of ILQ control and its application to BUR(Back-Up-Roll) eccentricity in strip rolling mill is discussed and compared to polynomial control approaches. Also the rolling mill model and basic principle to control thickness of srip are introduced with control effect by polynomial methods.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.317-322
• /
• 2010

This paper presents an algorithm generating inverse element over finite fields GF($3^m$), and constructing method of inverse element generator based on inverse element generating algorithm. An inverse computing method of an element over GF($3^m$) which corresponds to a polynomial over GF($3^m$) with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.693-699
• /
• 2010

In this paper we show that the flat property of a left R-module does not imply (carry over) to the corresponding inverse polynomial module. Then we define an induced inverse polynomial module as an R[x]-module, i.e., given an R-linear map f : M $\rightarrow$ N of left R-modules, we define $N+x^{-1}M[x^{-1}]$ as a left R[x]-module. Given an exact sequence of left R-modules $$0\;{\rightarrow}\;N\;{\rightarrow}\;E^0\;{\rightarrow}\;E^1\;{\rightarrow}\;0$$, where $E^0$, $E^1$ injective, we show $E^1\;+\;x^{-1}E^0[[x^{-1}]]$ is not an injective left R[x]-module, while $E^0[[x^{-1}]]$ is an injective left R[x]-module. Make a left R-module N as a left R[x]-module by xN = 0. We show inj $dim_R$ N = n implies inj $dim_{R[x]}$ N = n + 1 by using the induced inverse polynomial modules and their properties.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.225-231
• /
• 2007

Given an injective envelope E of a left R-module M, there is an associative Galois group Gal$({\phi})$. Let R be a left noetherian ring and E be an injective envelope of M, then there is an injective envelope $E[x^{-1}]$ of an inverse polynomial module $M[x^{-1}]$ as a left R[x]-module and we can define an associative Galois group Gal$({\phi}[x^{-1}])$. In this paper we describe the relations between Gal$({\phi})$ and Gal$({\phi}[x^{-1}])$. Then we extend the Galois group of inverse polynomial module and can get Gal$({\phi}[x^{-s}])$, where S is a submonoid of $\mathbb{N}$ (the set of all natural numbers).

• East Asian mathematical journal
• /
• v.24 no.2
• /
• pp.139-144
• /
• 2008

Given an injective envelope E of a left R-module M, there is an associative Galois group Gal($\phi$). Let R be a left noetherian ring and E be an injective envelope of M, then there is an injective envelope E[$x^{-1}$] of an inverse polynomial module M[$x^{-1}$] as a left R[x]-module and we can define an associative Galois group Gal(${\phi}[x^{-1}]$). In this paper we extend the Galois group of inverse polynomial module and can get Gal(${\phi}[x^{-s}]$), where S is a submonoid of $\mathds{N}$ (the set of all natural numbers).

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• Honam Mathematical Journal
• /
• v.20 no.1
• /
• pp.45-55
• /
• 1998