Epsilon-entropy of an Ellipsoid in a Hamming Space
Problems of Information Transmission
On the thinnest coverings of spheres and ellipsoids with balls in hamming and euclidean spaces
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.00 |
The problem of optimizing (finding the maximin of) the difference between the entropy functions of two n-dimensional vectors under special restrictions on their components is solved. This optimum gives the main term of the asymptotics for the ϵ-entropy of an ellipsoid in a Hamming space as the dimension of the space grows.