On the Structure of the Linear Codes with a Given Automorphism

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic codes and almost quasi-cyclic codes are discussed in detail, presenting necessary and sufficient conditions for which linear codes with such an automorphism are self-orthogonal, self-dual, or linear complementary dual

Self-dual codes with an automorphism of order 17

In this paper we study optimal binary self-dual codes with minimum distance 12 having an automorphism of order 17. We prove that all such codes have parameters [68 + f; 34 + f=2; 12]; f = 0; 2; 4 and automorphism of type 17- (4; f), f = 0; 2; 4 and provide a full classication of these codes. This classication gives: new values b = 17, 153, 170, 187, 221, 255 for = 0 in the weight enumerator W68,2 of [68, 34, 12] codes; new values b = 102, 136, 170, 204, 238, 272, 306, 340, 374, 408, 442, 476, 510, 544, 578, and 612 for g = 0 in W70,1 of [70, 35, 12] codes; numerous singly- and doubly-even [72, 36, 12] codes with new parameters in their weight enumerators