On computation of entropy of an ellipsoid in a Hamming space

Authors:
V. V. Prelov
Affiliations:
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2013

Citing 1
Cited 0

On the thinnest coverings of spheres and ellipsoids with balls in hamming and euclidean spaces

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Asymptotics of the entropy of an ellipsoid in a Hamming space of a growing dimension is investigated in the case where coefficients of the ellipsoid are monotone sequences of real numbers.