• 대한수학회보
• /
• 제57권2호
• /
• pp.459-479
• /
• 2020

In the last two decades, codes over noncommutative rings have been one of the main trends in coding theory. Due to the fact that noncommutativity brings many challenging problems in its nature, still there are many open problems to be addressed. In 2015, generator polynomial matrices and parity-check polynomial matrices of generalized quasi-cyclic (GQC) codes were investigated by Matsui. We extended these results to the noncommutative case. Exploring the dual structures of skew constacyclic codes, we present a direct way of obtaining parity-check polynomials of skew multi-twisted codes in terms of their generators. Further, we lay out the algebraic structures of skew multipolycyclic codes and their duals and we give some examples to illustrate the theorems.

• Kyungpook Mathematical Journal
• /
• 제58권1호
• /
• pp.19-35
• /
• 2018

Motivated mainly by certain interesting recent extensions of the generalized hypergeometric function [30] and the second Appell function [6], we introduce here the incomplete Lauricella functions ${\gamma}^{(n)}_A$ and ${\Gamma}^{(n)}_A$ of n variables. We then systematically investigate several properties of each of these incomplete Lauricella functions including, for example, their various integral representations, finite summation formulas, transformation and derivative formulas, and so on. We provide relevant connections of some of the special cases of the main results presented here with known identities. Several potential areas of application of the incomplete hypergeometric functions in one and more variables are also pointed out.

• 대한전자공학회논문지
• /
• 제23권2호
• /
• pp.149-169
• /
• 1986

Fundamentals of electrodynamics of moving sources with constant velocity in an anisotripic plasma when the do magnetic field and the relative motion are oriented in arbitrary directions are presented. The well-known Minkowski's relations are generalized to accomodate anisotropic and dispersive media, and relativistic transformation formulae of constitutive parameters are derived and expanded into polynomials of the speed ratio \ulcornerto increase the utility of the formulae. The helmholtz wave equation of electromagnetic fields is generalized to the media charactrized by tensor parameters, and is solved in operator form. Also the solution of wave equation is expressed as a porcuct of the inverse of the wave operator matrix and the source function vector, and the inverse of the wave operator matrix is presented in an explicit form. The equations and formulae derived in this paper are all general, and can be reduced to known and proven results upon imposing the restriction called for by specific situations.

• Kyungpook Mathematical Journal
• /
• 제51권4호
• /
• pp.435-456
• /
• 2011

The Chebyshev collocation method in [21] to solve stiff initial-value problems is generalized by using arbitrary degrees of interpolation polynomials and arbitrary collocation points. The convergence of this generalized Chebyshev collocation method is shown to be independent of the chosen collocation points. It is observed how the stability region does depend on collocation points. In particular, A-stability is shown by taking the mid points of nodes as collocation points.

• Nonlinear Functional Analysis and Applications
• /
• 제27권4호
• /
• pp.807-812
• /
• 2022

The need for smoothness measures emerged by mathematicians working in the fields of approximation theory, functional analysis and real analysis. In the present paper, a new version of generalized modulus of smoothness is studied. The aim of defining that modulus, is to find the degree of best L_p functions approximation via trigonometric polynomials. We benefit from Jackson integrals to arrive to the essential approximation theorems.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1607-1616
• /
• 2006

The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

• 호남수학학술지
• /
• 제43권2호
• /
• pp.183-197
• /
• 2021

Recently several authors have extended the Beta function by using its integral representation. However, in many cases no expression of these extended functions in terms of classic special functions is known. In the present paper, we introduce a further extension by defining a family of functions G_r,s : ℝ^*₊ → ℂ, with r, s ∈ ℂ and ℜ(r) > 0. For given r, s, we prove that this function satisfies a second-order linear differential equation with rational coefficients. Solving this ODE, we express G_r,s as a combination of confluent hypergeometric functions. From this we deduce a new integral relation satisfied by Tricomi's function. We then investigate additional specific properties of G_r,1 which take the form of new non trivial integral relations involving exponential and error functions. We discuss the connection between G_r,1 and Stokes' first problem (or Rayleigh problem) in fluid mechanics which consists in determining the flow created by the movement of an infinitely long plate. For $r{\in}{\frac{1}{2}}{\mathbb{N}}^*$, we find additional relations between G_r,1 and Hermite polynomials. In view of these results, we believe the family of extended beta functions G_r,s will find further applications in two directions: (i) for improving our knowledge of confluent hypergeometric functions and Tricomi's function, (ii) and for engineering and physics problems.

• 한국정보통신학회논문지
• /
• 제12권7호
• /
• pp.1209-1217
• /
• 2008

본 논문에서는 $GF(2^m)$ 상에서 표준기저를 사용한 두 다항식의 곱셈을 비트-병렬로 실현하는 새로운 형태의 비트-병렬 곱셈기를 제안하였다. 곱셈기의 구성에 앞서, 피승수 다항식과 기약다항식의 곱셈을 병렬로 수행 한 후 승수 다항식의 한 계수와 비트-병렬로 곱셈하여 결과를 생성하는 VCG를 구성하였다. VCG의 기본 셀은 2개의 AND 게이트와 2개의 XOR 게이트로 구성되며, 이들로부터 두 다항식의 비트-병렬 곱셈을 수행하여 곱셈 결과를 얻도록 하였다. 이러한 과정을 확장하여 m에 대한 일반화된 회로의 설계를 보였으며, 간단한 형태의 곱셈회로 구성의 예를 $GF(2^4)$를 통해 보였다. 또한 제시한 곱셈기는 PSpice 시뮬레이션을 통하여 동작특성을 보였다. 본 논문에서 제안한 곱셈기는 VCG의 기본 셀을 반복적으로 연결하여 구성하므로, 차수 m이 매우 큰 유한체상의 두 다항식의 곱셈에서 확장이 용이하며, VLSI에 적합하다.

• 한국통신학회논문지
• /
• 제40권5호
• /
• pp.833-840
• /
• 2015

본 논문에서는 미리 알려진 임의의 다항식과 암호화된 다항식의 곱셈을 수행한 후, 해당 곱셈이 정당하게 수행되었음을 보이기 위해 증명자 (Prover)와 검증자 (Verifier)간의 다항식 상등성 영지식증명 (Zero-knowledge Proof) 프로토콜을 일반화할 수 있는 방법을 다룬다. 이를 위하여 다항식의 상등성을 증명하는 일반화된 프로토콜을 제시하고 랜덤오라클 (Random Oracle) 모델에서 안전성을 증명한다. 이러한 기법은 안전한 집합연산 기법을 포함하여 다항식에 기반한 다자간 연산기법 (Secure Multi-party Computation)에 적용될 수 있다.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.455-462
• /
• 2012

The cyclic group $Cn={\langle}(12{\cdots}n){\rangle}$ acts on the set ($^{[n]}_k$) of all $k$-subsets of [$n$]. In this action of $C_n$ the number of orbits of size $d$, for $d|n$, is $$O^{n,k}_d=\frac{1}{d}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})(^{n/s}_{k/s})$$. Stanton and White[7] generalized the above identity to construct the orbit polynomials $$O^{n,k}_d(q)=\frac{1}{[d]_{q^{n/d}}}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})[^{n/s}_{k/s}]{_q}^s$$ and conjectured that $O^{n,k}_d(q)$ have non-negative coefficients. In this paper we give a combinatorial proof for the positivity of coefficients of the orbit polynomial $O^{n,3}_d(q)$.