Source Coding Theorem

Quentin Hibon 📧 and Lawrence C. Paulson 📧

October 19, 2016

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

This document contains a proof of the necessary condition on the code rate of a source code, namely that this code rate is bounded by the entropy of the source. This represents one half of Shannon's source coding theorem, which is itself an equivalence.

License

BSD License

Topics

Session Source_Coding_Theorem

Cite

× 
@article{Source_Coding_Theorem-AFP,
  author  = {Quentin Hibon and Lawrence C. Paulson},
  title   = {Source Coding Theorem},
  journal = {Archive of Formal Proofs},
  month   = {October},
  year    = {2016},
  note    = {\url{https://isa-afp.org/entries/Source_Coding_Theorem.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: