Computation of Automorphism Groups of q-ary Codes

The purpose of this work is to develop and implement an effective algorithm to find automorphism groups of different algebraic and combinatorial objects in n-dimensional vector space over finite field. We use the First String Method (FSM) to deal with the automorphism groups used in cryptography and coding theory.

There are downloads available under the Creative Commons License license. Download Now

Include in RSS: 

For more complete information about compiler optimizations, see our Optimization Notice.