OurBigBook
About
$
Donate
Sign in
Sign up
Min-entropy
(
H
∞
(
X
)
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Probability and statistics
Information theory
Information entropy
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For
a
discrete
random variable
with largest point
probability
p
m
a
x
, its min-
entropy
is
H
∞
(
X
)
=
−
lo
g
p
m
a
x
.
(1)
Table of contents
Information entropy dominates min-entropy
Min-entropy
Information entropy dominates min-entropy
0
0
0
Min-entropy
For
a
discrete
random variable
,
H
(
X
)
≥
H
∞
(
X
)
. Indeed, every point
probability
satisfies
p
x
≤
p
m
a
x
, so averaging
−
lo
g
p
x
≥
−
lo
g
p
m
a
x
proves the inequality.
Ancestors
(6)
Information entropy
Information theory
Probability and statistics
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version