Converse Bounds
Converse Bounds is a theoretical construct in finite blocklength information theory that establishes fundamental limits on the achievable performance of communication systems by providing necessary conditions that any reliable coding scheme must satisfy, thereby distinguishing achievable from unachievable combinations of rate, blocklength, and error probability.
290
Publications
17.5K
Citations
403
Authors
228
Institutions
Publications per year
2017–2026
91
Variants
Converse Bound
290
Coding theorem and strong converse for quantum channels
Andreas Winter · IEEE Transactions on Information Theory · 1999 · 479 citations · Full text
Engineering, Mathematics, Physics +16
Intrinsic robustness of the price of anarchy
Tim Roughgarden · 2009 · 339 citations
1–5 of 290
403
13
h-index
13
h-index
12
h-index
7
h-index
7
h-index
1–5 of 403
228
Princeton University
Princeton, United States
18 h-index
48 publications
13.8K citations
National University of Singapore
Singapore, Singapore
14 h-index
25 publications
891 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
13 h-index
24 publications
822 citations
University of California, Berkeley
Berkeley, United States
11 h-index
14 publications
348 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
21 publications
1.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
16 publications
825 citations

Cornell University
Ithaca, United States
9 h-index
10 publications
324 citations
Stanford University
Stanford, United States
9 h-index
12 publications
818 citations
1–8 of 228
85 publications · 9.3K citations
38
h-index
Repository · 14 publications · 184 citations
11
h-index
Repository · 5 publications · 194 citations
5
h-index
4 publications · 172 citations
4
h-index
4 publications · 171 citations
4
h-index
1–5