Covering an ellipsoid with equal balls
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Rate distortion and denoising of individual data using Kolmogorov complexity
IEEE Transactions on Information Theory
Hi-index | 0.06 |
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 ℝn, n \geq 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 numberof equal balls of ℝn covering the sphere Sn-1. The optimality of the asymptotic estimates is discussed.