### 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

- Mathematics/Probability theory

### Session Source_Coding_Theorem

- Source_Coding_Theorem

## Cite

×

Source_Coding_Theorem-AFP

    @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:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Oct 19, 2016 : Isabelle2016