We consider twisted permutation codes, a class of frequency permutation arrays obtained from finite groups with multiple permutation representations of the same degree, introduced by Gillespie, Praeger and Spiga (and later studied by Akbari, Gillespie and Praeger), and develop a decoding algorithm for such codes based on earlier work of the first author for permutation group codes. In particular, we show how to implement this algorithm for an infinite family of groups considered by Akbari, Gillespie and Praeger.

翻译：我们研究扭曲置换码——这是一类由吉莱斯皮、普雷格尔和斯皮加引入（后由阿克巴里、吉莱斯皮和普雷格尔进一步研究）的基于有限群且具有相同次数的多重置换表示的频率置换阵列。基于第一作者此前关于置换群码的工作，我们为此类码开发了一种解码算法，并具体展示了如何将这一算法应用于阿克巴里、吉莱斯皮和普雷格尔考虑的一个无限群族。