Increasing the minimum distance of codes by twisting

Authors M. Akbari, Neil I. Gillespie, Cheryl E. Praeger

Publication date 7 September 2018

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.07154, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p36

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

constant composition codes frequency permutation arrays permutation codes powerline communication twisted permutation codes

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear algebraic groups over finite fields (20G40) Combinatorial codes (94B25)

Abstract: Twisted permutation codes, introduced recently by the second and third authors, are frequency permutation arrays. They are similar to repetition permutation codes, in that they are obtained by a repetition construction applied to a smaller code. It was previously shown that the minimum distance of a twisted permutation code is at least the minimum distance of a corresponding repetition permutation code, but in some instances can be larger. We construct two new infinite families of twisted permutation codes with minimum distances strictly greater than those for the corresponding repetition permutation codes.

Review text

Summary: Twisted permutation codes, introduced recently by the second and third authors, belong to the family of frequency permutation arrays. Like some other codes in this family, such as the repetition permutation codes, they are obtained by a repetition construction applied to a smaller code (but with a ``twist allowed). The minimum distance of a twisted permutation code is known to be at least the minimum distance of a corresponding repetition permutation code, but in some instances can be larger. We construct two new infinite families of twisted permutation codes with minimum distances strictly greater than those for the corresponding repetition permutation codes. These constructions are based on two infinite families of finite groups and their representations. The first is a family of \(p\)-groups, for an odd prime \(p\), while the second family consists of the \(4\)-dimensional symplectic groups over a finite field of even order. In the latter construction, properties of the graph automorphism of these symplectic groups play an important role.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Increasing the minimum distance of codes by twisting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671660)