Achievability Bounds
Achievability Bounds is a theoretical construct in finite blocklength information theory that establishes the fundamental limits on reliable communication by specifying the minimum error probability achievable for a given blocklength and rate, thereby distinguishing itself from converse bounds by providing sufficient conditions for the existence of codes that achieve a desired performance.
204
Publications
13.7K
Citations
356
Authors
185
Institutions
Publications per year
2017–2026
52
204
A perspective on massive random-access
Yury Polyanskiy · 2017 · 474 citations
Concise security bounds for practical decoy-state quantum key distribution
Charles Ci Wen Lim, Marcos Curty, Nino Walenta et al. · Physical Review A · 2014 · 394 citations · Full text
Computing, Computer Science, Physics +11
E. N. Gilbert, F. MacWilliams, N. J. A. Sloane · Bell System Technical Journal · 1974 · 383 citations
1–5 of 204
356
13
h-index
11
h-index
7
h-index
7
h-index
6
h-index
1–5 of 356
185
Princeton University
Princeton, United States
18 h-index
44 publications
14.2K citations
National University of Singapore
Singapore, Singapore
13 h-index
19 publications
982 citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
18 publications
1.4K citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
14 publications
311 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
10 h-index
20 publications
497 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
14 publications
515 citations
Chalmers University of Technology
Gothenburg, Sweden
7 h-index
18 publications
1.8K citations
University of Maryland, College Park
College Park, United States
7 h-index
9 publications
232 citations
1–8 of 185
47 publications · 6.8K citations
29
h-index
Repository · 12 publications · 215 citations
11
h-index
PRA · 5 publications · 565 citations
5
h-index
4 publications · 138 citations
4
h-index
Repository · 4 publications · 261 citations
4
h-index
1–5