  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.
