The permutation group of affine-invariant extended cyclic codes (Q4336401)

In this paper the affine-invariant codes and the permutation group of any affine-invariant code is presented. The authors give several methods to the effective determination of permutation groups of primitive cyclic codes and the permutation groups of their extension. The methods are based on the combinatorial structure of the defining set -- using the classification of affine-invariant codes by antichains and of the polynomial representation of permutations. There are examples given in order to explain these methods in detail and to establish their efficiency. The result of \textit{Ph. Delsarte} [ibid. 16, 760-769 (1970; Zbl 0209.22002)] is completed as follows : The permutation group of a given affine-invariant code can be fully characterized from combinatorial properties of its defining set. As an application of the previous results, the permutation group of any BCH code defined over a prime field is determined.