OurBigBook
About
$
Donate
Sign in
Sign up
Fixed-rate source-coding error exponent
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Probability and statistics
Information theory
Shannon noiseless coding theorem
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For an IID finite-
alphabet
source
Q
encoded at rate
R
>
H
(
Q
)
, the optimal block error
probability
has exponential rate
min
P
:
H
(
P
)
≥
R
D
(
P
∥
Q
)
.
(1)
Ancestors
(6)
Shannon noiseless coding theorem
Information theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2024
/
iii
/
Paper 224
/
4
/
a
/
Solution
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