Entropy In Coding Theory

Entropy in Coding Theory is a fundamental measure in information theory that quantifies the average amount of information produced by a stochastic source of data, serving as the theoretical foundation for determining the limits of data compression and the efficiency of coding schemes.

301

Publications

20.1K

Citations

531

Authors

286

Institutions

Publications per year

2017–2026

27

Parents

Authors

531

  1. SV
    Sergio Verdú

    Princeton University, United States

    6 publications · 547 citations

    6

    h-index

  2. MM
    Muriel Médard

    Massachusetts Institute of Technology, United States

    4 publications · 96 citations

    4

    h-index

  3. RF
    R. F. Rice

    Jet Propulsion Laboratory, United States

    4 publications · 333 citations

    4

    h-index

  4. AO
    Alon Orlitsky

    University of California San Diego, United States

    4 publications · 632 citations

    4

    h-index

  5. NM
    Nicolas Macris

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

    4 publications · 85 citations

    4

    h-index

1–5 of 531

Venues

  1. IEEE Transactions on Information Theory

    85 publications · 9.9K citations

    42

    h-index

  2. Entropy

    7 publications · 239 citations

    7

    h-index

  3. Electronics Letters

    4 publications · 51 citations

    4

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 149 citations

    4

    h-index

  5. Pacific Journal of Mathematics

    3 publications · 171 citations

    3

    h-index

1–5