Twisted Permutation Codes

Neil I. Gillespie, Cheryl E. Praeger, Pablo Spiga

Research output: Working paperPreprint

1 Downloads (Pure)


We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a lower bound for the minimum distance of a twisted permutation code is the minimum distance of a repetition permutation code. We give examples where this bound is tight, but more importantly, we give examples of twisted permutation codes with minimum distance strictly greater than this lower bound.
Original languageEnglish
Publication statusPublished - 21 Feb 2014


Dive into the research topics of 'Twisted Permutation Codes'. Together they form a unique fingerprint.

Cite this