Random Coding Bounds is a theoretical framework in finite blocklength information theory that characterizes the fundamental limits of reliable communication over noisy channels by deriving upper and lower bounds on the achievable error probability using randomly generated codes under specific decoding rules.
111
Publications
6.7K
Citations
164
Authors
94
Institutions
Publications per year
2017–2026
14
Publications
111
1–5 of 111
Authors
164
- AG
10
h-index
- AG
10
h-index
- NM
10
h-index
- JSJonathan Scarlett
École Polytechnique Fédérale de Lausanne, Switzerland
7 publications · 214 citations
7
h-index
- AL
3
h-index
1–5 of 164
Institutions
94
Technion – Israel Institute of Technology
Haifa, Israel
12 h-index
16 publications
378 citations
University of Cambridge
Cambridge, United Kingdom
10 h-index
20 publications
521 citations
Universitat Pompeu Fabra
Barcelona, Spain
9 h-index
17 publications
602 citations
Institució Catalana de Recerca i Estudis Avançats
Barcelona, Spain
6 h-index
6 publications
177 citations
Cornell University
Ithaca, United States
5 h-index
7 publications
665 citations
Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
787 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
5 publications
277 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
5 publications
150 citations
1–8 of 94
Venues
- IEEE Transactions on Information Theory
55 publications · 4.5K citations
34
h-index
- IEEE Transactions on Communications
3 publications · 253 citations
3
h-index
- IEEE Journal on Selected Areas in Communications
3 publications · 36 citations
3
h-index
- arXiv (Cornell University)
Repository · 2 publications · 23 citations
2
h-index
- Journal of Mathematical Physics
1 publications · 24 citations
1
h-index
1–5