Unfortunately, to the best of our knowledge, there are no simple algorithms for testing code equivalence. It was shown in [1]} that code equivalence problem can be reduced to the graph isomorphism problem in polynomial time. The support splitting algorithm [2]} can be used to find a permutation between equivalent codes. Code equivalence test based on canonical augmentation is proposed in [3]}, [4]}.
