Name
Abstract | ||
|---|---|---|
The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, the main goal is to find its ε-entropy, which is the logarithm of the minimum number of the balls of radius ε needed to cover this ellipsoid. A tight asymptotic bound on the ε-entropy is obtained for all but the most oblong ellipsoids, which have very high eccentricity. This bound depends only on the volume of the sub-ellipsoid spanned over all the axes of the original ellipsoid, whose length (diameter) exceeds 2ε. The results can be applied to vector quantization performed when data streams from different sources are bundled together in one block. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TIT.2004.834759 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
entropy codes,vector quantisation,ϵ-entropy,arbitrary dimension,data stream,eccentricity,euclidean space,minimum number logarithm,oblong ellipsoid,thinnest covering,vector quantization,Covering,Euclidean space,ellipsoid,entropy,unit ball | Journal | 50 |
Issue | ISSN | Citations |
10 | 0018-9448 | 3 |
PageRank | References | Authors |
0.84 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. Dumer | 1 | 94 | 14.44 |
| Mark S. Pinsker | 2 | 35 | 13.59 |
| Vyacheslav V. Prelov | 3 | 145 | 29.59 |