OurBigBook About$ Donate
 Sign in Sign up

Expected codeword length (L(c))

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Information theory Huffman coding Optimal prefix code
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
For a source symbol X and a code c, the expected codeword length is
L(c)=E[∣c(X)∣]=∑x​P(X=x)∣c(x)∣.
(1)

 Ancestors (7)

  1. Optimal prefix code
  2. Huffman coding
  3. Information theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / d / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / f / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 1 / 11K / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 2 / 3I / a / ii / 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