The Automorphism Groups of the Kerdock Codes
Claude Carlet · Journal of Information and Optimization Sciences · 1991
We prove that the automorphism group of the Kerdock code of length 2 m (m even ≥6) is the group of permutations on GF(2 m )≈GF(2 m–1 )×GF(2) generated by the automorphism group of the field GF(2 m–1 ), the affine group of GF(2 m–1 ), and the translations on GF(2).