Decoding Complexity

Decoding Complexity is the computational cost associated with the process of reconstructing transmitted information from encoded signals in channel coding, distinguishing it from related complexity measures by its focus on the intricacy of the decoding algorithm rather than encoding or transmission aspects.

2.3K

Publications

125.7K

Citations

3.8K

Authors

957

Institutions

Publications per year

2017–2026

451

Authors

3.8K

  1. WJ
    Warren J. Gross

    McGill University, Canada

    46 publications · 3K citations

    27

    h-index

  2. AB
    Andreas Burg

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

    23 publications · 2.5K citations

    18

    h-index

  3. CZ
    Chuan Zhang

    Southeast University, China

    23 publications · 742 citations

    17

    h-index

  4. XY
    Xiaohu You

    Southeast University, China

    25 publications · 781 citations

    17

    h-index

  5. SL
    Shu Lin

    University of California, Davis, United States

    17 publications · 2.2K citations

    16

    h-index

1–5 of 3.8K

Venues

  1. IEEE Transactions on Information Theory

    211 publications · 29.5K citations

    64

    h-index

  2. IEEE Transactions on Communications

    249 publications · 18.3K citations

    62

    h-index

  3. IEEE Communications Letters

    141 publications · 7.4K citations

    41

    h-index

  4. IEEE Transactions on Signal Processing

    55 publications · 7K citations

    31

    h-index

  5. IEEE Transactions on Wireless Communications

    70 publications · 3.1K citations

    29

    h-index

1–5