Many topics and techniques regarding asymptotic centers and asymptotic radius were studied by Edelstein 1 , Bose and Laskar 2 , Downing and Kirk 3 , Goebel and Kirk 4 , and Lan and Webb 5 . Now, We recall that definitions of asymptotic center and asymptotic radius. Let C be a nonempty subset of a Banach space X and {xn} a bounded sequence in X. Consider the functional ra ·, {xn} : X → R defined by

In this paper, we restudy the covering radius of block codes from an information theoretic point of view by ignoring the combinatorial formulation of the problem. In the new setting, the formula of the statistically defined minimum covering radius, for which the probability mass of uncovered space by M spheres can be made arbitrarily small, is reduced to a minimization of a statistically define...

We give an explicit upper bound of the minimal number νT,n of balls of radius 1/2 which form a covering of a ball of radius T > 1/2 in R , n > 2. The asymptotic estimates of νT,n we deduce when n is large are improved further by recent results of Böröczky Jr. and Wintsche on the asymptotic estimates of the minimal number of equal balls of R n covering the sphere S. The optimality of the asympto...

h this paper, the asymptotic stability of interval neutral delay-differential systems is investigated. A delay-independent criterion for the stability of the system is derived in terms of the spectral radius. Numerical computations are performed to illustrate the result. @ 2003 Elsevier Ltd. All rights reserved. Keywords-Interval neutral system, Asymptotic stability, Spectral radius.

........................................................................................................................................................ 2 Acknowledgements ....................................................................................................................................... 3 Introduction .............................................................................

We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...

For an ATM multiplexer we develop a recursive asymptotic expansion method for approximating the queue length distribution and investigate the radius of convergence of the queue asymptotic expansion series. The analysis focuses on “small” to “moderate” buffer sizes under the conditions of strictly stable multiple time scale arrivals. For a class of examples we analytically determine the radius o...