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.
Problems of Information Transmission – Springer Journals
Published: Oct 13, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud