• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1150-1156
• /
• 2006

In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over $F_p$ of M-ary Sidel'nikov sequences of period $p^m-1$ when $M\geq3$ and $p\equiv{\pm}1$ mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when $p^m-1$ and $m\geq4$. Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.231-240
• /
• 2015

To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.93-107
• /
• 2005

Based on the recently developed ABS algorithm for solving linear Diophantine equations, we present a special ABS algorithm for solving such equations which is effective in computation and storage, not requiring the computation of the greatest common divisor. A class of equations always solvable in integers is identified. Using this result, we discuss the ILP problem with upper and lower bounds on the variables.

• Kyungpook Mathematical Journal
• /
• v.57 no.4
• /
• pp.701-709
• /
• 2017

In this paper, we introduce the minimum covering Randic energy of a graph. We compute minimum covering Randic energy of some standard graphs and establish upper and lower bounds for this energy. Also we disprove a conjecture on Randic energy which is proposed by S. Alikhani and N. Ghanbari, [2].

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.251-261
• /
• 2010

This paper deals with a predator-prey model with Holling type III response function and cross-diffusion subject to the homogeneous Neumann boundary condition. We first give a priori estimates (positive upper and lower bounds) of positive steady states. Then the non-existence and existence results of non-constant positive steady states are given as the cross-diffusion coefficient is varied, which means that stationary patterns arise from cross-diffusion.

• Honam Mathematical Journal
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2007

In this paper we show that for each finite frame for a Hilbert space there are two orthonormal elements related to the optimal lower and upper bounds of the frame. Based on this we show that an orthonormal basis is naturally associated with every finite frame. We then analyze the relationship between such an orthonormal basis and the given finite frame.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1133-1138
• /
• 1991

A control of nonlinear system is motivated by the fact that all real plants are nonlinear systems and model identification introduces parameter errors. The purpose of this study is to design a Discrete Variable Structure Controller(DVSC) for single-rod hydraulic cylinder system. The model contains uncertain parameters which we known to lie upper and lower bounds. In the design of DVSC, the boundary layer concept was adopted to reduce cattering. The DVSC was evaluated through digital computer simulation and compared with a VSC (analog controller).

• Honam Mathematical Journal
• /
• v.34 no.2
• /
• pp.219-230
• /
• 2012

In the paper, a symbolic construction is considered to define generalized Cantor-like sets. Lower and upper bounds for the correlation dimension of the sets with a regular condition are obtained with respect to a probability Borel measure. Especially, for some special cases of the sets, the exact formulas of the correlation dimension are established and we show that the correlation dimension and the Hausdorff dimension of some of them are the same. Finally, we find a condition which guarantees the positive correlation dimension of the generalized Cantor-like sets.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.331-338
• /
• 2006

The Paley-type inequalities for the complete convergence and lower and upper bounds in the Baum-Katz law of large numbers for i.i.d. random variables sequence are obtained. The results obtained generalize the result of Pruss [8].

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.475-486
• /
• 2011

The paper deals with repeated low-density burst error detecting codes with a specied weight or less. Linear codes capable of detecting such errors have been studied. Further codes capable of correcting and simultaneously detecting such errors have also been dealt with. The paper obtains lower and upper bounds on the number of parity-check digits required for such codes. An example of such a code has also been provided.