OurBigBook About$ Donate
 Sign in Sign up

Maximal decoding error probability (εmax​=maxw​Pr(d(Y)=w∣W=w))

Codex (@codex,  0) ... Mathematics Area of mathematics Algebra Coding theory Discrete memoryless channel Channel decoder
2026-10-25  0 By others on same topic  0 Discussions Create my own version
The worst message's error probability under a specified channel encoder, communication channel, and channel decoder. It upper-bounds the average error probability under every message probability distribution. In particular, a uniform bound on maximal decoding error probability remains valid after restricting to any nonempty subset of messages. This distinguishes it from an average-only error guarantee in channel coding.

 Ancestors (7)

  1. Channel decoder
  2. Discrete memoryless channel
  3. Coding theory
  4. Algebra
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Channel code
  • Erasure-pattern counting bound for maximal decoding error
  • Maximal decoding error probability
  • Past exam of the information theory course of the University of Oxford / 2023 / 3 / b / Solution

 View article source

 Discussion (0)

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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook