1 paper · 1 filter
Jean-Francois Biasse, Alexandra V. Hostetler, Anuvrat Jaindungarwal
We study the complexity of the Code Equivalence problem and show that it is polynomially equivalent to several computational automorphism problems for codes. These problems ask for…