Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial

Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha

The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem i…