On the computation of the automorphism group of a linear code

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 13-

  Sendrier, Nicolas ^a   Skersys, Gintaras ^b  

^a INRIA   (France)

^b VILNIUS UNIVERSITY   (Lithuania)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISM GROUP; LINEAR CODE; PERMUTATION GROUPS; SUPPORT SPLITTING ALGORITHM;

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

BINARY CODES;

EID: 0034850978     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2001.935876     Document Type: Article

References (8)

1. Affine and projective planes
2. Computing automorphism groups of error-correcting codes
3. Permutation group algorithms based on partition, I: Theory and algorithm
4. Partitions, refinements, and permutation group computation
5. On the dimension of the hull
6. Finding the permutation between equivalent codes: The support splitting algorithm
7. Computational methods in the study of permutation groups
8. Calcul du groupe d'automorphisme des codes. Détermination de l'équivalence des codes