LoadPackage("guava");
gap> C1 := GeneratorMatCode( [ [0,0,1,1], [1,1,0,0] ], GF(2));
a linear [4,2,1..2]1..2 code defined by generator matrix over GF(2)
gap> AutomorphismGroup(C1);
Group([ (3,4), (1,4)(2,3) ])
On 25/10/2011, at 10:29 AM, Vo Tam Van wrote:
> Hi every body
>
> I am looking for the source code of computing the automorphism group
> of linear code. For example, the binary linear code
> C = { [0,0,0,0]; [0,0,1,1]; [1,1,0,0]; [1,1,1,1]} has the permutation
> group of order 8. Please teach me how to write GAP program to
> compute automorphism of linear code C. Any comments and helps are
> highly appreciated. Thanks alot.
>
> Tam Van
>
> _______________________________________________
> Forum mailing list
> Forum@mail.gap-system.org
> http://mail.gap-system.org/mailman/listinfo/forum
Professor Gordon Royle
School of Mathematics and Statistics
University of Western Australia
gordon.ro...@uwa.edu.au
_______________________________________________
Forum mailing list
Forum@mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum
