• Title/Summary/Keyword: characteristic polynomials

Search Result 76, Processing Time 0.034 seconds

On the 3-Ranks and Characteristic Polynomials of HKN and Lin Difference Sets

  • Jong-Seon No;Dong-Joon Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.7A
    • /
    • pp.1257-1263
    • /
    • 2001
  • In the paper, the p-ranks and characteristics polynomials of cyclic difference sets are derived by expanding the trace expression of their characteristic sequences. By using this method, it is shown that the 3-ranks and characteristic polynomials of Helleseth-Kumar-Martinsen (HKM) difference set and Lin difference set can be easily obtained.

  • PDF

Analysis of One-dimensional cellular automata over GF(q)

  • Cho, Sung-Jin;Kim, Han-Doo;Choi, Un-Sook
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.21-32
    • /
    • 2000
  • We study theoretical aspects of one-dimensional cellular automata over GF(q), where q is a power of a prime. Some results about the characteristic polynomials of such cellular automata are given. Intermediate boundary cellular automata are defined and related to the more common null boundary cellular automata.

  • PDF

Flexural-Torsional Coupled Vibration of Slewing Beams Using Various Types of Orthogonal Polynomials

  • Kapania Rakesh K.;Kim, Yong-Yook
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.11
    • /
    • pp.1790-1800
    • /
    • 2006
  • Dynamic behavior of flexural-torsional coupled vibration of rotating beams using the Rayleigh-Ritz method with orthogonal polynomials as basis functions is studied. Performance of various orthogonal polynomials is compared to each other in terms of their efficiency and accuracy in determining the required natural frequencies. Orthogonal polynomials and functions studied in the present work are: Legendre, Chebyshev, integrated Legendre, modified Duncan polynomials, the special trigonometric functions used in conjunction with Hermite cubics, and beam characteristic orthogonal polynomials. A total of 5 cases of beam boundary conditions and rotation are studied for their natural frequencies. The obtained natural frequencies and mode shapes are compared to those available in various references and the results for coupled flexural-torsional vibrations are especially compared to both previously available references and with those obtained using NASTRAN finite element package. Among all the examined orthogonal functions, Legendre orthogonal polynomials are the most efficient in overall CPU time, mainly because of ease in performing the integration required for determining the stiffness and mass matrices.

STUDY ON HURWITZ STABILITY CONDITIONS OF THE CHARACTERISTIC POLYNOMIALS USING THE COEFFICIENT DIAGRAM (계수도를 이용한 특성다항식의 Hurwitz 안정조건에 관한 연구)

  • Kang, Hwan-Il
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.413-416
    • /
    • 1998
  • We investigate the Hurwitz stability condition using the coefficient diagram. The coefficient diagram consists of a plot of logarithmic values of the coefficients of the characteristic polynomial versus the degree of the coresponding coefficients. The logarithmic value of the coefficient of the characteristic polynomials are plotted in the descending order. Using the Bhattacharyya, Chapellat and Keel's algorithm, the sufficient and necessary condition for Hurwitz stability are reconstructed using the coefficient diagram. With the coefficient diagram we also present some necessary or sufficient conditions for Hurwitz stability of polynomials. In addition we obtain a lower bound for the Manabe parameter $\tau$.

  • PDF

Relation between the Irreducible Polynomials that Generates the Same Binary Sequence Over Odd Characteristic Field

  • Ali, Md. Arshad;Kodera, Yuta;Park, Taehwan;Kusaka, Takuya;Nogmi, Yasuyuki;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.3
    • /
    • pp.166-172
    • /
    • 2018
  • A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

MATHIEU GROUP COVERINGS AND GOLAY CODES

  • Yie, Ik-Kwon
    • Journal of the Korean Mathematical Society
    • /
    • v.39 no.2
    • /
    • pp.289-317
    • /
    • 2002
  • We associate binary codes to polynomials over fields of characteristic two and show that the binary Golay codes are associated to the Mathieu group polynomials in characteristics two. We give two more polynomials whose Galois group in $M_{12}$ but different self-orthogonal binary codes are associated. Also, we find a family of $M_{24}$-coverings which includes previous ones.

AN EASILY CHECKING CONDITION FOR THE STAVILITY TEST OF A FAMILY OF POLYNOMIALS WITH NONLIMEARLY PERTURBED COEFFICIENTS

  • Kim, Young-Chol;Hong, Woon-Seon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.5-9
    • /
    • 1995
  • In many cases of robust stability problems, the characteristic polynomial has real coefficients which or nonlinear functions of uncertain parameters. For this set of polynomials, a new stability easily checking algorithm for reducing the conservatism of the stability bound are given. It is the new stability theorem to determine the stability region just in parameter space. Illustrative example show that the presented method has larger stability bound in uncertain parameter space than others.

  • PDF

MWCA Test using 90/150 HCA (90/150 HCA를 이용한 MWCA 판정법)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Han-Doo;Kim, Jin-Gyoung;Kang, Sung-Won
    • 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.