Twisted permutation codes

N.I. Gillespie, Cheryl Praeger, P. Spiga

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)


    © 2015 by De Gruyter. 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
    JournalJournal of Group Theory
    Issue number3
    Publication statusPublished - May 2015


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

      Gillespie, N. I., Praeger, C. E. & Spiga, P., 21 Feb 2014, arXiv.

      Research output: Working paperPreprint


    Cite this