CodeIsomorphism( C_1, C_2 )
If the two codes C_1 and C_2 are equivalent codes (see
IsEquivalent), CodeIsomorphism
returns the permutation that
transforms C_1 into C_2. If the codes are not equivalent, it
returns false
.
gap> H := GeneratorPolCode([1,1,0,1]*Z(2), 7, GF(2)); a cyclic [7,4,1..3]1 code defined by generator polynomial over GF(2) gap> CodeIsomorphism(H, HammingCode(3, GF(2))); (3,4)(5,6,7) gap> PermutedCode(H, (3,4)(5,6,7)) = HammingCode(3, GF(2)); true
GAP 3.4.4