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

Authors

1.2K

  1. GP
    Giovanni Peccati

    University of Luxembourg, Luxembourg

    9 publications · 505 citations

    9

    h-index

  2. AD
    A. D. Barbour

    University of Zurich, Switzerland

    7 publications · 169 citations

    7

    h-index

  3. AR
    Adrian Röllin

    National University of Singapore, Singapore

    7 publications · 352 citations

    7

    h-index

  4. GS
    Govind S. Mudholkar

    University of Rochester, United States

    6 publications · 99 citations

    6

    h-index

  5. XF
    Xiao Fang

    University of Utah, United States

    6 publications · 138 citations

    6

    h-index

1–5 of 1.2K

Venues

  1. Journal of the American Statistical Association

    54 publications · 6.3K citations

    28

    h-index

  2. The Annals of Statistics

    25 publications · 2.8K citations

    21

    h-index

  3. Biometrika

    25 publications · 1.9K citations

    19

    h-index

  4. The Annals of Probability

    25 publications · 2.2K citations

    19

    h-index

  5. Statistics in Medicine

    19 publications · 1.9K citations

    18

    h-index

1–5