Source Coding Theorem

The Source Coding Theorem is a foundational result in information theory that establishes the minimum number of bits per symbol, asymptotically achievable by lossless compression, required to represent a stationary ergodic source, thereby delineating the theoretical limit of data compression in terms of the source's entropy rate.

200

Publications

19.4K

Citations

244

Authors

134

Institutions

Publications per year

2017–2026

7

Variants

Shannon's Source Coding Theorem

Authors

244

  1. RM
    Robert M. Gray

    Stanford University, United States

    16 publications · 867 citations

    15

    h-index

  2. NM
    Neri Merhav

    Technion – Israel Institute of Technology, Israel

    7 publications · 245 citations

    7

    h-index

  3. JC
    John C. Kieffer

    University of Minnesota, United States

    7 publications · 178 citations

    7

    h-index

  4. TS
    Te Sun Han

    University of Electro-Communications, Japan

    7 publications · 943 citations

    7

    h-index

  5. LD
    L. Davisson

    University of Southern California, United States

    5 publications · 269 citations

    5

    h-index

1–5 of 244

Venues

  1. IEEE Transactions on Information Theory

    110 publications · 10.5K citations

    49

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 60 citations

    4

    h-index

  3. ArXiv.org

    Repository · 4 publications · 158 citations

    4

    h-index

  4. 3

    h-index

  5. The Annals of Probability

    3 publications · 74 citations

    3

    h-index

1–5