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

Authors

407

  1. GD
    Giuseppe Durisi

    Chalmers University of Technology, Sweden

    12 publications · 781 citations

    12

    h-index

  2. WY
    Wei Yang

    Chalmers University of Technology, Sweden

    9 publications · 409 citations

    9

    h-index

  3. YP
    Yury Polyanskiy

    Massachusetts Institute of Technology, United States

    8 publications · 615 citations

    8

    h-index

  4. RU
    Rüdiger Urbanke

    École Polytechnique Fédérale de Lausanne, Switzerland

    8 publications · 1.2K citations

    8

    h-index

  5. HV
    H. Vincent Poor

    Princeton University, United States

    7 publications · 539 citations

    7

    h-index

1–5 of 407

Venues

  1. IEEE Transactions on Information Theory

    32 publications · 2.2K citations

    19

    h-index

  2. IEEE Transactions on Communications

    15 publications · 1.2K citations

    15

    h-index

  3. IEEE Transactions on Vehicular Technology

    12 publications · 487 citations

    11

    h-index

  4. IEEE Transactions on Wireless Communications

    9 publications · 544 citations

    9

    h-index

  5. IEEE Wireless Communications Letters

    8 publications · 592 citations

    8

    h-index

1–5