• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.677-682
• /
• 2007

The unique positive zero of $F_m(z):=z^{2m}-z^{m+1}-z^{m-1}-1$ leads to analogues of $2(\array{2n\\k}\)$(k even) by using hypergeometric functions. The minimal polynomials of these analogues are related to Chebyshev polynomials, and the minimal polynomial of an analogue of $2(\array{2n\\k}\)$(k even>2) can be computed by using an analogue of $2(\array{2n\\k}\)$. In this paper we show that the analogue of $2(\array{2n\\2}\)$. In this paper we show that the analygue $2(\array{2n\\2}\)$ is the only real zero of its minimal polynomial, and has a different representation, by using a polynomial of smaller degree than $F_m$(z).

• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.667-682
• /
• 2016

In this article we show a recursive method to compute the coefficients of the minimal polynomial of cos($2{\pi}/n$) explicitly for $n{\geq}3$. The recursion is not on n but on the coefficient index. Namely, for a given n, we show how to compute ei of the minimal polynomial ${\sum_{i=0}^{d}}(-1)^ie_ix^{d-i}$ for $i{\geq}2$ with initial data $e_0=1$, $e_1={\mu}(n)/2$, where ${\mu}(n)$ is the $M{\ddot{o}}bius$ function.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.425-435
• /
• 2003

In this paper, a new kind of matrices, i.e., $level-{\kappa}$ II-circulant matrices is considered. Algorithms for computing minimal polynomial of this kind of matrices are presented by means of the algorithm for the Grobner basis of the ideal in the polynomial ring. Two algorithms for finding the inverses of such matrices are also presented based on the Buchberger's algorithm.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.251-263
• /
• 2004

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Grobner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.91-101
• /
• 2001

This paper is to develop replacement models under minimal repair with exponential polynomial wavelet failure rate function. Wavelets have good time-frequency localization, fast algorithms and parsimonious representation. Also this study is presented along with numerical examples using sensitivity analysis for exponential polynomial trigonometric failure rate function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.156-163
• /
• 2013

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.577-584
• /
• 2005

Optimal methods for designing multiplierless minimal complexity FIR filters with cascaded prefilter-equalizer structures are proposed for narrowband communication systems. Assuming that an FIR filter consists of a cyclotomic polynomial(CP) prefilter and an interpolated second order polynomial(ISOP) equalizer, in the proposed method the prefilter and equalizer are simultaneously designed using mixed integer linear programming(MILP). The resulting filter is a cascaded filter with minimal complexity. Design examples demonstrate that the proposed methods produce a more computationally efficient cascaded prefilter-equalizer than other existing filters.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1957-1972
• /
• 2013

The reflexive property for ideals was introduced by Mason and has important roles in noncommutative ring theory. In this note we study the structure of idempotents satisfying the reflexive property and introduce reflexive-idempotents-property (simply, RIP) as a generalization. It is proved that the RIP can go up to polynomial rings, power series rings, and Dorroh extensions. The structure of non-Abelian RIP rings of minimal order (with or without identity) is completely investigated.

• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.275-286
• /
• 2001

In this paper, a skew polynomial ring $R[x;\alpha]$ of a ring R with a monomorphism $\alpha$ are investigated as follows: For a reduced ring R, assume that $\alpha(P){\subseteq}P$ for any minimal prime ideal P in R. Then (i) $R[x;\alpha]$ is a reduced ring, (ii) a ring R is Baer(resp. quasi-Baer, p.q.-Baer, a p.p.-ring) if and only if the skew polynomial ring $R[x;\alpha]$ is Baer(resp. quasi-Baer, p.q.-Baer, a p.p.-ring).