  The majorizing measure theorem of Fernique and Talagrand is a fundamental
result in the theory of random processes. It relates the boundedness of random
processes indexed by elements of a metric space to complexity measures arising
from certain multiscale combinatorial structures, such as packing and covering
trees. This paper builds on the ideas first outlined in a little-noticed
preprint of Andreas Maurer to present an information-theoretic perspective on
the majorizing measure theorem, according to which the boundedness of random
processes is phrased in terms of the existence of efficient variable-length
codes for the elements of the indexing metric space.
