Increasing the minimum distance of codes by twisting

MaRDI QIDQ1671660zbMATH OpenFDO

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 codespermutation codesfrequency permutation arrayspowerline communicationtwisted permutation codes

Mathematics Subject Classification ID

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

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.

Recommendations

• Twisted permutation codes
• Equidistant permutation group codes
• Codes from affine permutation groups
• Bounds on permutation codes of distance four
• Some constant weight codes from primitive permutation groups

Cites work

• scientific article; zbMATH DE number 3125713 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 54047 (Why is no real title available?)
• scientific article; zbMATH DE number 3598475 (Why is no real title available?)
• scientific article; zbMATH DE number 3023391 (Why is no real title available?)
• Constructions for permutation codes in powerline communications
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
• Decoding Frequency Permutation Arrays Under Chebyshev Distance
• Diagonally neighbour transitive codes and frequency permutation arrays
• Equidistant frequency permutation arrays and related constant composition codes
• Frequency permutation arrays
• Neighbour transitivity on codes in Hamming graphs
• On constant composition codes
• Twisted permutation codes

Cited in

(3)

• scientific article; zbMATH DE number 7790332 (Why is no real title available?)
• Improvement on minimum distance of symbol-pair codes
• Twisted permutation codes

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)