DocumentCode :
3273597
Title :
On the computation of the automorphism group of a linear code
Author :
Sendrier, Nicolas ; Skersys, Gintaras
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fYear :
2001
fDate :
2001
Firstpage :
13
Abstract :
We present here an algorithm for computing the automorphism group of a binary linear code. It is based on Leon´s algorithm (1982), but the use of the support splitting algorithm in the refinement process allows us to address the problem for some very large codes
Keywords :
binary codes; group codes; linear codes; automorphism group computation; binary linear code; permutation group; support splitting algorithm; very large codes; Costs; Genetic mutations; Linear code; Microscopy; Orbits; Partitioning algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
Type :
conf
DOI :
10.1109/ISIT.2001.935876
Filename :
935876
Link To Document :
بازگشت