Finding the permutation between equivalent binary codes
Nicolas Sendrier · 2002
We present here an algorithm able to compute the permutation between two given equivalent binary linear codes. The algorithm only works if the automorphism group of the considered codes is trivial, that is reduced to the identity permutation. For random codes of length 1000 and dimension 500, the computation time needed is about one second on a workstation DEC alpha 500/266.