Syndrome Decoding Problem

The Syndrome Decoding Problem is a computational problem in coding theory, belonging to the class of NP-hard decision problems, that consists in determining whether there exists a binary vector of given weight that produces a specified syndrome under a given parity-check matrix of a linear code.

84

Publications

2.5K

Citations

187

Authors

113

Institutions

Publications per year

2017–2026

23

Authors

187

  1. PG
    Philippe Gaborit

    Université de Limoges, France

    8 publications · 450 citations

    8

    h-index

  2. TT
    Trieu‐Kien Truong

    I-Shou University, Taiwan

    5 publications · 110 citations

    5

    h-index

  3. KT
    K.K. Tzeng

    Lehigh University, United States

    4 publications · 135 citations

    4

    h-index

  4. JS
    Julien Schrek

    Université de Limoges, France

    3 publications · 207 citations

    3

    h-index

  5. CC
    Chalie Charoenlarpnopparut

    Thammasat University, Thailand

    3 publications · 33 citations

    3

    h-index

1–5 of 187

Venues

  1. IEEE Transactions on Information Theory

    24 publications · 914 citations

    17

    h-index

  2. IEEE Transactions on Communications

    5 publications · 154 citations

    5

    h-index

  3. Designs Codes and Cryptography

    2 publications · 52 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 47 citations

    2

    h-index

  5. Advances in Mathematics of Communications

    2 publications · 42 citations

    2

    h-index

1–5