• Korean Journal of Mathematics
• /
• v.15 no.1
• /
• pp.79-85
• /
• 2007

We study codes over the polynomial ring $\mathbb{F}_q[D]$ and introduce the notion of basic codes which play a fundamental role in the theory.

• Journal of Integrative Natural Science
• /
• v.1 no.2
• /
• pp.149-159
• /
• 2008

We develop two algorithms that nd a minimal polynomial of a finite sequence. One uses Euclid's algorithm, and the other is in essence a minimal polynomial version of the Berlekamp-Massey algorithm. They are formulated naturally and proved algebraically using polynomial arithmetic. They connects up seamlessly with decoding procedure of alternant codes.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.3
• /
• pp.135-144
• /
• 2004

In this paper, we propose competitive fuzzy polynomial neurons-based advanced Self-Organizing Neural Networks(SONN) architecture for optimal model identification and discuss a comprehensive design methodology supporting its development. The proposed SONN dwells on the ideas of fuzzy rule-based computing and neural networks. And it consists of layers with activation nodes based on fuzzy inference rules and regression polynomial. Each activation node is presented as Fuzzy Polynomial Neuron(FPN) which includes either the simplified or regression polynomial fuzzy inference rules. As the form of the conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as linear, quadratic, and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership (unction are studied and the number of the premise input variables used in the rules depends on that of the inputs of its node in each layer. We introduce two kinds of SONN architectures, that is, the basic and modified one with both the generic and the advanced type. Here the basic and modified architecture depend on the number of input variables and the order of polynomial in each layer. The number of the layers and the nodes in each layer of the SONN are not predetermined, unlike in the case of the popular multi-layer perceptron structure, but these are generated in a dynamic way. The superiority and effectiveness of the Proposed SONN architecture is demonstrated through two representative numerical examples.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.287-294
• /
• 2023

The goal of this paper is to extend some inequalities of Bernstein as well as Turán type to polar derivative of a polynomial.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.85-90
• /
• 2003

This paper proposes a modular multiplier based on LFSR (Linear Feedback Shift Register) architecture with efficient area complexity over GF(2/sup m/). At first, we examine the modular exponentiation algorithm and propose it's architecture, which is basic module for public-key cryptosystems. Furthermore, this paper proposes on efficient modular multiplier as a basic architecture for the modular exponentiation. The multiplier uses AOP (All One Polynomial) as an irreducible polynomial, which has the properties of all coefficients with '1 ' and has a more efficient hardware complexity compared to existing architectures.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1471-1479
• /
• 2013

In this paper, we study the non-existence of finite order entire solutions of nonlinear differential-difference of the form $$f^n+Q(z,f)=h$$, where $n{\geq}2$ is an integer, $Q(z,f)$ is a differential-difference polynomial in $f$ with polynomial coefficients, and $h$ is a meromorphic function of order ${\leq}1$.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.3
• /
• pp.813-830
• /
• 2023

Let p(z) be a polynomial of degree n having no zero in |z| < 1. In this paper, by involving some coefficients of the polynomial, we prove an inequality that not only improves as well as generalizes the well-known result proved by Rivlin but also has some interesting consequences.

• The Pure and Applied Mathematics
• /
• v.31 no.1
• /
• pp.49-56
• /
• 2024

For a Polynomial P(z) = Σⁿ_j=0 a_jz^j with a_j ≥ a_j-1, a₀ > 0 (j = 1, 2, ..., n), a classical result of Enestrom-Kakeya says that all the zeros of P(z) lie in |z| ≤ 1. This result was generalized by A. Joyal et al. [3] where they relaxed the non-negative condition on the coefficents. This result was further generalized by Dewan and Bidkham [9] by relaxing the monotonicity of the coefficients. In this paper, we use some techniques to obtain some more generalizations of the results [3], [8], [9].