Achievability Bounds

Achievability Bounds is a theoretical construct in finite blocklength information theory that establishes the fundamental limits on reliable communication by specifying the minimum error probability achievable for a given blocklength and rate, thereby distinguishing itself from converse bounds by providing sufficient conditions for the existence of codes that achieve a desired performance.

204

Publications

13.7K

Citations

356

Authors

185

Institutions

Publications per year

2017–2026

52

Authors

356

  1. HV
    H. Vincent Poor

    Princeton University, United States

    15 publications · 4.7K citations

    13

    h-index

  2. YP
    Yury Polyanskiy

    Massachusetts Institute of Technology, United States

    11 publications · 5.4K citations

    11

    h-index

  3. WY
    Wei Yang

    Chalmers University of Technology, Sweden

    7 publications · 959 citations

    7

    h-index

  4. GD
    Giuseppe Durisi

    Chalmers University of Technology, Sweden

    7 publications · 847 citations

    7

    h-index

  5. VY
    Vincent Y. F. Tan

    National University of Singapore, Singapore

    6 publications · 174 citations

    6

    h-index

1–5 of 356

Venues

  1. IEEE Transactions on Information Theory

    47 publications · 6.8K citations

    29

    h-index

  2. arXiv (Cornell University)

    Repository · 12 publications · 215 citations

    11

    h-index

  3. Physical Review A

    PRA · 5 publications · 565 citations

    5

    h-index

  4. IEEE Transactions on Communications

    4 publications · 138 citations

    4

    h-index

  5. ArXiv.org

    Repository · 4 publications · 261 citations

    4

    h-index

1–5