Binary linear codes and binary matrices

الملخص EN

In [1], the automorphism group of a binary linear code is computed by identifying it with one of its optimal generator matrices.

This identi cation is e ective for the computation of the automorphism group of a binary linear code.

As application, we show in this work that the automorphism group of the binary triple-error-correcting primitive BCH code C of length n = 31 is the general linear group GL5(F2) on the vector space F32 over F2.

Numerical examples are given by the use of some theoretical software : GAP 4:8:5 (Group Algorithm Programming), Q-extension and Grin 4:0 (Graph Interface).