Normal Approximation
Normal Approximation is a mathematical technique in finite blocklength information theory that characterizes the non-asymptotic fundamental limits of communication by approximating the logarithm of the maximum achievable code size as a Gaussian random variable whose mean and variance correspond to the mutual information and channel dispersion, respectively.
779
Publications
45.8K
Citations
1.2K
Authors
624
Institutions
Publications per year
2017–2026
74
779
1–5 of 779
1.2K
9
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 1.2K
624
National University of Singapore
Singapore, Singapore
17 h-index
32 publications
2K citations
Iowa State University
Ames, United States
11 h-index
17 publications
686 citations

Cornell University
Ithaca, United States
11 h-index
17 publications
602 citations
University of Zurich
Zurich, Switzerland
10 h-index
15 publications
393 citations

The University of Melbourne
Melbourne, Australia
10 h-index
20 publications
525 citations
Harvard University
Cambridge, United States
10 h-index
11 publications
2.5K citations

Pennsylvania State University
State College, United States
9 h-index
12 publications
804 citations

Australian National University
Canberra, Australia
9 h-index
12 publications
733 citations
1–8 of 624
54 publications · 6.3K citations
28
h-index
25 publications · 2.8K citations
21
h-index
25 publications · 1.9K citations
19
h-index
25 publications · 2.2K citations
19
h-index
19 publications · 1.9K citations
18
h-index
1–5