Finite Blocklength Analysis
Finite Blocklength Analysis is a theoretical framework in information theory that characterizes the fundamental limits of reliable communication over noisy channels at finite codeword lengths, distinguishing it from asymptotic analyses by explicitly accounting for the trade-offs between rate, error probability, and blocklength in non-asymptotic regimes.
189
Publications
10.3K
Citations
407
Authors
208
Institutions
Publications per year
2017–2026
95
Parents
189
Elements of Information Theory, Wiley Series in Telecommunications
Thomas M. Cover, Thomas Allen · 1991 · 628 citations
1–5 of 189
407
12
h-index
9
h-index
8
h-index
8
h-index
7
h-index
1–5 of 407
208
Chalmers University of Technology
Gothenburg, Sweden
16 h-index
49 publications
3K citations
Princeton University
Princeton, United States
13 h-index
19 publications
1.7K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
11 h-index
23 publications
4.3K citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
15 publications
583 citations
PLA Army Engineering University
Nanjing, China
6 h-index
21 publications
1.1K citations
ETH Zurich
Zurich, Switzerland
5 h-index
7 publications
403 citations

Southeast University
Nanjing, China
5 h-index
6 publications
528 citations

KTH Royal Institute of Technology
Stockholm, Sweden
5 h-index
12 publications
691 citations
1–8 of 208
32 publications · 2.2K citations
19
h-index
15 publications · 1.2K citations
15
h-index
12 publications · 487 citations
11
h-index
9 publications · 544 citations
9
h-index
8 publications · 592 citations
8
h-index
1–5