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
Parents
129
Some Further Theory of Group Codes
D. Slepian · Bell System Technical Journal · 1960 · 132 citations
Is code equivalence easy to decide?
Erez Petrank, Ron M. Roth · IEEE Transactions on Information Theory · 1997 · 127 citations
1–5 of 129
239
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 239
156
Nanyang Technological University
Singapore, Singapore
6 h-index
6 publications
236 citations

Loyola University Chicago
Chicago, United States
4 h-index
4 publications
80 citations
University of Chicago
Chicago, United States
4 h-index
6 publications
144 citations
Technical University of Munich
Munich, Germany
3 h-index
4 publications
193 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
3 h-index
5 publications
79 citations
Technical University of Denmark
Kongens Lyngby, Denmark
3 h-index
7 publications
214 citations
Politecnico di Milano
Milan, Italy
3 h-index
3 publications
74 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
308 citations
1–8 of 156
50 publications · 2K citations
25
h-index
4 publications · 86 citations
5
h-index
Repository · 4 publications · 60 citations
4
h-index
3 publications · 130 citations
3
h-index
3 publications · 68 citations
3
h-index
1–5