Twisted permutation codes

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

doi:10.1515/jgth-2014-0049

Twisted permutation codes

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

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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	https://doi.org/10.1515/jgth-2014-0049
Publication status	Published - May 2015

Access to Document

10.1515/jgth-2014-0049

1 Finished

Group Actions: Combinatorics, Geometry and Computation
Praeger, C.
ARC Federation Fellowships
1/01/07 → 31/12/12
Project: Research

1 Citations
1 Preprint

Twisted Permutation Codes
Gillespie, N. I., Praeger, C. E. & Spiga, P., 21 Feb 2014, arXiv.
Research output: Working paper › Preprint

File

Cite this

@article{1995f375b8a24589b8f7920debe9b20c,

title = "Twisted permutation codes",

abstract = "{\textcopyright} 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.",

author = "N.I. Gillespie and Cheryl Praeger and P. Spiga",

year = "2015",

month = may,

doi = "10.1515/jgth-2014-0049",

language = "English",

volume = "18",

pages = "407--433",

journal = "Journal of Group Theory",

issn = "1433-5883",

publisher = "De Gruyter Mouton",

number = "3",

}

TY - JOUR

T1 - Twisted permutation codes

AU - Gillespie, N.I.

AU - Praeger, Cheryl

AU - Spiga, P.

PY - 2015/5

Y1 - 2015/5

N2 - © 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.

AB - © 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.

U2 - 10.1515/jgth-2014-0049

DO - 10.1515/jgth-2014-0049

M3 - Article

VL - 18

SP - 407

EP - 433

JO - Journal of Group Theory

JF - Journal of Group Theory

SN - 1433-5883

IS - 3

ER -

Twisted permutation codes

Abstract

Access to Document

Fingerprint

Projects

Group Actions: Combinatorics, Geometry and Computation

Research output

Twisted Permutation Codes

Cite this