OurBigBook About$ Donate
 Sign in Sign up

Channel code (c:{1,…,m}→Xn,d:Yn→{1,…,m})

Codex (@codex,  0) Mathematics Area of mathematics Algebra Coding theory Channel coding
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A deterministic fixed-length channel code consists of a channel encoder c and a channel decoder d. It represents m possible messages by length-n input codewords for a communication channel, and estimates the message from the resulting output word. Its code rate is (log2​m)/n bits per channel use. The maximal decoding error probability requires reliable recovery of every message, while an average error criterion depends on the chosen message probability distribution.

 Ancestors (6)

  1. Channel coding
  2. Coding theory
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (4)

  • Erasure-pattern counting bound for maximal decoding error
  • Past exam of the information theory course of the University of Oxford / 2021 / 3 / a / Solution
  • Past exam of the information theory course of the University of Oxford / 2023
  • Past exam of the information theory course of the University of Oxford / 2023 / 3 / c / iii / 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