Dear all, I am looking for the formula of complexity of computation automorphism group of (n,k) binary linear codes. I think it would be (n!) or greater by using the brute-force algorithm.
Does anyone have an optimal algorithm to reduce the complexity. Please tell me the algorithm and the formula of complexity of computation automorphism group. Does it depend only on n or both n and k? Thank you very much and I am looking forward to your reply. Best Regards, Vo Tam Van _______________________________________________ Forum mailing list Forum@mail.gap-system.org http://mail.gap-system.org/mailman/listinfo/forum
