Twisted permutation codes

Neil I Gillespie, Cheryl E. Praeger, Pablo Spiga

Research output: Contribution to journalArticle (Academic Journal)peer-review

2 Citations (Scopus)
347 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
Pages (from-to)407-433
Number of pages20
JournalJournal of Group Theory
Issue number3
Early online date16 Dec 2014
Publication statusPublished - May 2015


Dive into the research topics of 'Twisted permutation codes'. Together they form a unique fingerprint.

Cite this