Huffman Coding

Huffman Coding is a lossless data compression algorithm that belongs to the class of greedy algorithms, distinguished by its construction of an optimal prefix-free binary code through iteratively merging the two least frequent symbols into a single node until a full binary tree is formed.

688

Publications

35.2K

Citations

1.4K

Authors

626

Institutions

Publications per year

2017–2026

136

Authors

1.4K

  1. ST
    Shmuel T. Klein

    Bar-Ilan University, Israel

    9 publications · 327 citations

    9

    h-index

  2. JS
    Jeffrey Scott Vitter

    Duke University, United States

    8 publications · 895 citations

    8

    h-index

  3. HY
    H. Yamamoto

    The University of Tokyo, Japan

    6 publications · 126 citations

    6

    h-index

  4. RH
    Reza Hashemian

    Northern Illinois University, United States

    6 publications · 238 citations

    6

    h-index

  5. DS
    Dana Shapira

    Ariel University, Israel

    6 publications · 118 citations

    6

    h-index

1–5 of 1.4K

Venues

  1. IEEE Transactions on Information Theory

    60 publications · 3.9K citations

    30

    h-index

  2. IEEE Transactions on Communications

    19 publications · 872 citations

    15

    h-index

  3. 13

    h-index

  4. IEEE Access

    10 publications · 351 citations

    10

    h-index

  5. 10

    h-index

1–5