RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2013 Volume 49, Issue 1, Pages 3–18 (Mi ppi2098)
This article is cited in 1 paper

Information Theory

On computation of entropy of an ellipsoid in a Hamming space

V. V. Prelov

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow

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.

UDC: 621.391.1+519.72

Received: 17.04.2012
Revised: 14.11.2012


 English version: Problems of Information Transmission, 2013, 49:1, 1–14

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024