Code Equivalence Problem

The Code Equivalence Problem is a computational problem in code-based cryptography that belongs to the class of equivalence detection problems, distinguished by its focus on determining whether two linear codes are structurally identical under a specified transformation, such as permutation or monomial equivalence.

129

Publications

4.2K

Citations

239

Authors

156

Institutions

Publications per year

2017–2026

20

Authors

239

  1. WC
    W. Cary Huffman

    Loyola University Chicago, United States

    4 publications · 80 citations

    4

    h-index

  2. YQ
    Youming Qiao

    University of Technology Sydney, Australia

    2 publications · 47 citations

    2

    h-index

  3. JG
    Jon G. Riecke

    Nokia (United States), United States

    2 publications · 58 citations

    2

    h-index

  4. MG
    Matthew G. Parker

    University of Bergen, Norway

    2 publications · 29 citations

    2

    h-index

  5. HN
    Harold N. Ward

    University of Virginia, United States

    2 publications · 84 citations

    2

    h-index

1–5 of 239

Venues

  1. IEEE Transactions on Information Theory

    50 publications · 2K citations

    25

    h-index

  2. Designs Codes and Cryptography

    4 publications · 86 citations

    5

    h-index

  3. arXiv (Cornell University)

    Repository · 4 publications · 60 citations

    4

    h-index

  4. Journal of Combinatorial Theory Series A

    3 publications · 130 citations

    3

    h-index

  5. IEEE Communications Letters

    3 publications · 68 citations

    3

    h-index

1–5