In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For the remaining cases, we show that the codes are not completely transitive assuming an upper bound on the order of the monomial automorphism groups, according to computational results.

翻译：在之前的两篇论文中，我们通过拼接方法构造了完全正则码的新族。本文确定了新码为完全传递的情况，并求出了这些情况下码的自同构群。对于其余情况，根据计算结果，在单项自同构群阶的上界假设下，我们证明了这些码不是完全传递的。