• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.287-300
• /
• 2005

In this paper, we analyze Pseudo-Noise (PN) sequences generated by a maximum-length 90/150 Null Boundary Cellular Automata and we give the relationship among minimum offsets.

• The Pure and Applied Mathematics
• /
• v.24 no.2
• /
• pp.69-77
• /
• 2017

If q(z) is a polynomial of degree n with all zeros in the unit circle, then the self-reciprocal polynomial $q(z)+x^nq(1/z)$ has all its zeros on the unit circle. One might naturally ask: where are the zeros of $q(z)+x^nq(1/z)$ located if q(z) has different zero distribution from the unit circle? In this paper, we study this question when $q(z)=(z-1)^{n-k}(z-1-c_1){\cdots}(z-1-c_k)+(z+1)^{n-k}(z+1+c_1){\cdots}(z+1+c_k)$, where $c_j$ > 0 for each j, and q(z) is a 'zeros dragged' polynomial from $(z-1)^n+(z+1)^n$ whose all zeros lie on the imaginary axis.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.1
• /
• pp.235-242
• /
• 2019

Self-reciprocal polynomials over finite fields are useful in several applications, including reversible codes with read-backward properties. This paper is a study on 90/150 CA with characteristic polynomials of maximal weight polynomials, which is one of the self-reciprocal polynomials. In this paper, we propose a decision method for determining the existence of 90/150 MWCA corresponding to the maximum weight polynomial of degree 2n using n-cell 90/150 CA with transition rule <$100{\cdots}0$>. The proposed method is verified through experiments.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.4
• /
• pp.641-646
• /
• 2004

A convex combination of two products with same degree of finitely many finite geometric series with each having even degree does not always have all its zeros on the unit circle. However, in this paper, we show that a polynomial obtained by just adding a finite geometric series multiplied by a large constant to such a convex combination has all its zeros on the unit circle.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.49-52
• /
• 2004

In this paper, we analyze Pseudo-Noise (PN) sequences generated by a 90/150 maximum-length Null Boundary Cellular Automata.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.195-197
• /
• 1987

A new method of model reduction, based on the differentiation of polynomials, is Introduced by Gutman(1982). Without the reciprocal transformation, and the differentiation of the numerator and denominator polynomials of the transfer function, used by Gutman, the lower-order system can be obtained by the permutation of the order of numerator and denominator and the number of differentiation.

• Journal of applied mathematics & informatics
• /
• v.37 no.1_2
• /
• pp.23-35
• /
• 2019

Self-reciprocal polynomials are important because it is possible to specify only half of the coefficients. The special case of the self-reciprocal polynomial, the maximum weight polynomial, is particularly important. In this paper, we analyze even cell 90/150 cellular automata with linear rule blocks of the form < $a_1,{\cdots},a_n,d_1,d_2,b_n,{\cdots},b_1$ >. Also we show that there is no 90/150 CA of the form < $U_n{\mid}R_2{\mid}U^*_n$ > or < $\bar{U_n}{\mid}R_2{\mid}\bar{U^*_n}$ > whose characteristic polynomial is $f_{2n+2}(x)=x^{2n+2}+{\cdots}+x+1$ where $R_2$ =< $d_1,d_2$ > and $U_n$ =< $0,{\cdots},0$ >, and $\bar{U_n}$ =< $1,{\cdots},1$ >.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.745-760
• /
• 2006

In this paper, we particularly deal with no $F_p$-rational two-torsion elliptic curves, where $F_p$ is the prime field of the characteristic p. First we introduce a shift product-based polynomial transform. Then, we show that the parities of (#E - 1)/2 and (#E' - 1)/2 are reciprocal to each other, where #E and #E' are the orders of the two candidate curves obtained at the last step of complex multiplication (CM)-based algorithm. Based on this property, we propose a method to check the parity by using the shift product-based polynomial transform. For a 160 bits prime number as the characteristic, the proposed method carries out the parity check 25 or more times faster than the conventional checking method when 4 divides the characteristic minus 1. Finally, this paper shows that the proposed method can make CM-based algorithm that looks up a table of precomputed class polynomials more than 10 percent faster.