Universal Coding For Markov Sources

Universal Coding for Markov Sources is a theoretical framework in information theory that enables lossless data compression of sequences generated by unknown Markov sources by employing a universal code that asymptotically achieves the entropy rate of the source without prior knowledge of its transition probabilities.

13

Publications

616

Citations

22

Authors

21

Institutions

Publications per year

2017–2026

1

Authors

22

  1. WS
    Wojciech Szpankowski

    Purdue University West Lafayette, United States

    2 publications · 160 citations

    2

    h-index

  2. LD
    L. Davisson

    University of Southern California, United States

    2 publications · 149 citations

    2

    h-index

  3. PC
    Paul C. Shields

    University of Toledo, United States

    2 publications · 78 citations

    2

    h-index

  4. SA
    Serap A. Savari

    Texas A&M University, United States

    1 publications · 88 citations

    1

    h-index

  5. HY
    Hidetoshi Yokoo

    Gunma University, Japan

    1 publications · 10 citations

    1

    h-index

1–5 of 22

Venues

  1. IEEE Transactions on Information Theory

    10 publications · 571 citations

    10

    h-index

  2. 1

    h-index

1–2