Using the description of primitive cyclic codes in a modular algebra, the author characterizes the permutations of the support of a cyclic code which leaves the code globally invariant. Applying this result to the binary double-error-correcting BCH codes, the author proves that the automorphism group of such a code (of length 2/sup m/-1,m<4) is the semi-linear group of GF(2/sup m/) over GF(2/sup m/), and, in the special case m=4, the semi-linear group of GP(16) over GF(4).
展开▼
机译：作者使用模块化代数中的原始循环码描述，描述了循环码支持的排列，从而使代码全局不变。将此结果应用于二进制双纠错BCH码，作者证明了这种码（长度为2 / sup m / -1，m <4）的自同构群是GF（2 / sup m /）超过GF（2 / sup m /），在特殊情况下m = 4，则是GP（16）超过GF（4）的半线性群。
展开▼
