• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• The Korean Journal of Applied Statistics
• /
• v.17 no.1
• /
• pp.75-88
• /
• 2004

The Support Vector Machine(SVM) algorithm has paid attention on maximizing the shortest distance between sample points and discrimination hyperplane. This paper suggests the total margin algorithm which considers the distance between all data points and the separating hyperplane. The method extends existing support vector machine algorithm. In addition, this newly proposed method improves the generalization error bound. Numerical experiments show that the total margin algorithm provides good performance, comparing with the previous methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.3
• /
• pp.245-248
• /
• 2010

Almost all of control schemes proposed so far have been designed in the continuous-time domain theoretically. Actual systems, however, have been implemented in the discrete-time domain since Micro Control Unit(MCU) and/or microprocessors have been used for the controllers. Thus, the overall system turned to be a sampled-data system, and generally speaking, the ultimate error cannot converge to zero in the actual system even though the proposed control algorithm showed the asymptotic stability in the continuous-time domain. In this paper, therefore, the ultimate error bound of a sampled data system with a short sampling period has been investigated. The ultimate error is shown to be related in the sampling period.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.34-43
• /
• 1994

The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• Honam Mathematical Journal
• /
• v.30 no.3
• /
• pp.581-587
• /
• 2008

In this paper, to have a better a posteriori error bound of the average case error between the true value of I(f) and the Trapezoidal rule on subintervals using zero mean-Gaussian, we prove that a new average error between the difference of the true value of I(f) from the composite Trapezoidal rule and that of the composite Trapezoidal rule from the simple Trapezoidal rule is bounded by $c_rH^{2r+3}$ through direct computation of constants $c_r$ for r ${\leq}$ 2 under the assumption that we have subintervals (for simplicity equal length h) partitioning [0, 1].

• Journal of Satellite, Information and Communications
• /
• v.7 no.1
• /
• pp.53-58
• /
• 2012

In this paper, we evaluate and analyze representative estimation methods for the sparse channel. In order to evaluate error performance of matching pursuit(MP) and minimum mean square error(MMSE) algorithm, lower bound of MMSE is determined by Cramer-Rao bound and compared with upper bound of MP. Based on analysis of those bounds, mean square error of MP which is effective in the estimation of sparse channel can be larger than that of MMSE according to the number of estimated tap and signal-to-noise ratio. Simulation results show that the performances of both algorithm are reversed on the sparse channel with Rayleigh fading according to signal-to-noise ratio.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.257-265
• /
• 2009

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.861-873
• /
• 2005

In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.