On coding theorem connected with “useful” entropy of order-.
Jain, Priti, Tuteja, R.K. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Jain, Priti, Tuteja, R.K. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Dar, Rayees Ahmad, Baig, M.A.K. (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Harish C. Taneja, R. K. Tuteja (1986)
Kybernetika
Similarity:
Wenbo Li, Werner Linde (2000)
Studia Mathematica
Similarity:
Let T be a precompact subset of a Hilbert space. We estimate the metric entropy of co(T), the convex hull of T, by quantities originating in the theory of majorizing measures. In a similar way, estimates of the Gelfand width are provided. As an application we get upper bounds for the entropy of co(T), , , by functions of the ’s only. This partially answers a question raised by K. Ball and A. Pajor (cf. [1]). Our estimates turn out to be optimal in the case of slowly decreasing sequences...
Paul Erdős, István Joó, Vilmos Komornik (1998)
Acta Arithmetica
Similarity:
Jean-Yves Audibert (2004)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Apostolos Giannopoulos (1997)
Studia Mathematica
Similarity:
Let V be an origin-symmetric convex body in , n≥ 2, of Gaussian measure . It is proved that for every choice of vectors in the Euclidean unit ball , there exist signs with . The method used can be modified to give simple proofs of several related results of J. Spencer and E. D. Gluskin.