OurBigBook About$ Donate
 Sign in Sign up

Fixed-length lossy code (Rn​=n−1log2​Mn​)

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Information theory Rate-distortion theory Rate-distortion function
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A fixed-length lossy code maps a block of n source symbols to one of Mn​ messages, then maps that message to a reconstruction block. The encoder and decoder together define the reconstruction. Its rate is log2​Mn​/n bits per source symbol; an implementation using a fixed binary message needs ⌈log2​Mn​⌉ transmitted bits per block. Its performance also depends on expected distortion, block length, and the chosen distortion measure.

 Ancestors (7)

  1. Rate-distortion function
  2. Rate-distortion theory
  3. Information theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Fixed-length lossy code
  • Shannon's rate-distortion theorem

 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