Shannon Source Coding Theorem
The Shannon Source Coding Theorem is a fundamental theorem in information theory that establishes the theoretical limit for lossless data compression, specifying that the minimum average number of bits needed to represent each symbol of a source is bounded below by the source's entropy.
127
Publications
12.2K
Citations
176
Authors
95
Institutions
Publications per year
2017–2026
5
Variants
First Shannon TheoremShannon's Source Coding Theorem
Parents
127
Mathematical Foundations of Information Theory.
J. Laurie Snell, Aleksandr I︠A︡kovlevich Khinchin, Ray Silverman et al. · American Mathematical Monthly · 1959 · 1.5K citations
Recent results in the Shannon theory
A.D. Wyner · IEEE Transactions on Information Theory · 1974 · 645 citations
Elements of Information Theory, Wiley Series in Telecommunications
Thomas M. Cover, Thomas Allen · 1991 · 628 citations
1–5 of 127
176
7
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 176
95
University of California, Berkeley
Berkeley, United States
10 h-index
16 publications
1.6K citations
Stanford University
Stanford, United States
6 h-index
8 publications
249 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
7 publications
761 citations
California Institute of Technology
Pasadena, United States
5 h-index
8 publications
596 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
11 publications
433 citations

University of Electro-Communications
Tokyo, Japan
5 h-index
5 publications
898 citations
Tokyo Institute of Technology
Tokyo, Japan
4 h-index
5 publications
97 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
5 publications
121 citations
1–8 of 95
50 publications · 5.8K citations
31
h-index
3 publications · 125 citations
3
h-index
3 publications · 108 citations
3
h-index
2 publications · 53 citations
2
h-index
2 publications · 43 citations
2
h-index
1–5