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.

Gillespie, N., Praeger, C., & Spiga, P. (2015). Twisted permutation codes. JOURNAL OF GROUP THEORY, 18(3), 407-433 [10.1515/jgth-2014-0049].

Twisted permutation codes

SPIGA, PABLO
Ultimo
2015

Abstract

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.
Articolo in rivista - Articolo scientifico
Algebra and Number Theory
English
407
433
27
Gillespie, N., Praeger, C., & Spiga, P. (2015). Twisted permutation codes. JOURNAL OF GROUP THEORY, 18(3), 407-433 [10.1515/jgth-2014-0049].
Gillespie, N; Praeger, C; Spiga, P
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/99641
Citazioni
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
Social impact