Compression Bounds

Compression Bounds is a theoretical construct in lossless data compression that specifies the fundamental limits on the achievable compression ratio for a given source, distinguishing itself by quantifying the minimum average codeword length attainable under optimal encoding.

305

Publications

16.7K

Citations

543

Authors

274

Institutions

Publications per year

2017–2026

62

Authors

543

  1. FC
    Franck Cappello

    Argonne National Laboratory, United States

    12 publications · 720 citations

    12

    h-index

  2. SD
    Sheng Di

    Argonne National Laboratory, United States

    10 publications · 662 citations

    10

    h-index

  3. JZ
    J. Ziv

    Technion – Israel Institute of Technology, Israel

    8 publications · 744 citations

    8

    h-index

  4. ZC
    Zizhong Chen

    University of California, Riverside, United States

    7 publications · 597 citations

    7

    h-index

  5. XL
    Xin Liang

    Argonne National Laboratory, United States

    7 publications · 236 citations

    7

    h-index

1–5 of 543

Venues

  1. IEEE Transactions on Information Theory

    62 publications · 5K citations

    32

    h-index

  2. arXiv (Cornell University)

    Repository · 20 publications · 499 citations

    13

    h-index

  3. SIAM Journal on Computing

    5 publications · 457 citations

    5

    h-index

  4. Journal of the ACM

    JACM · 5 publications · 850 citations

    5

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 121 citations

    4

    h-index

1–5