Source Coding With Finite Blocklength

Source Coding with Finite Blocklength is a theoretical framework in information theory that characterizes the fundamental limits of data compression when a finite number of source symbols are encoded, distinguishing it from classical source coding by accounting for non-asymptotic trade-offs between blocklength, rate, and error probability.

74

Publications

3.5K

Citations

114

Authors

61

Institutions

Publications per year

2017–2026

10

Authors

114

  1. VK
    Victoria Kostina

    California Institute of Technology, United States

    6 publications · 402 citations

    6

    h-index

  2. SV
    Sergio Verdú

    Princeton University, United States

    5 publications · 384 citations

    5

    h-index

  3. VY
    Vincent Y. F. Tan

    National University of Singapore, Singapore

    5 publications · 134 citations

    5

    h-index

  4. OK
    Oliver Kosut

    Arizona State University, United States

    4 publications · 84 citations

    4

    h-index

  5. SW
    Shun Watanabe

    Tokushima University, Japan

    4 publications · 115 citations

    4

    h-index

1–5 of 114

Venues

  1. IEEE Transactions on Information Theory

    36 publications · 2.2K citations

    24

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 28 citations

    2

    h-index

  3. 2

    h-index

  4. GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.

    Conference · 1 publications · 12 citations

    1

    h-index

  5. Bell System Technical Journal

    BSTJ · 1 publications · 41 citations

    1

    h-index

1–5