Converse Bounds

Converse Bounds is a theoretical construct in finite blocklength information theory that establishes fundamental limits on the achievable performance of communication systems by providing necessary conditions that any reliable coding scheme must satisfy, thereby distinguishing achievable from unachievable combinations of rate, blocklength, and error probability.

290

Publications

17.5K

Citations

403

Authors

228

Institutions

Publications per year

2017–2026

91

Variants

Converse Bound

Authors

403

  1. YP
    Yury Polyanskiy

    Massachusetts Institute of Technology, United States

    14 publications · 5K citations

    13

    h-index

  2. HV
    H. Vincent Poor

    Princeton University, United States

    15 publications · 4.4K citations

    13

    h-index

  3. SV
    Sergio Verdú

    Princeton University, United States

    12 publications · 4.5K citations

    12

    h-index

  4. MG
    Michael Gastpar

    University of California, Berkeley, United States

    7 publications · 160 citations

    7

    h-index

  5. WY
    Wei Yang

    Chalmers University of Technology, Sweden

    7 publications · 959 citations

    7

    h-index

1–5 of 403

Venues

  1. IEEE Transactions on Information Theory

    85 publications · 9.3K citations

    38

    h-index

  2. arXiv (Cornell University)

    Repository · 14 publications · 184 citations

    11

    h-index

  3. UTS ePRESS (University of Technology Sydney)

    Repository · 5 publications · 194 citations

    5

    h-index

  4. Journal of Combinatorial Theory Series A

    4 publications · 172 citations

    4

    h-index

  5. 4

    h-index

1–5