Abstract
© 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 language | English |
|---|---|
| Pages (from-to) | 407-433 |
| Journal | Journal of Group Theory |
| Volume | 18 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - May 2015 |
Fingerprint Dive into the research topics of 'Twisted permutation codes'. Together they form a unique fingerprint.
Cite this
Gillespie, N. I., Praeger, C., & Spiga, P. (2015). Twisted permutation codes. Journal of Group Theory, 18(3), 407-433. https://doi.org/10.1515/jgth-2014-0049