Isometries and Construction of Permutation Arrays

DOI10.1109/TIT.2010.2048449MaRDI QIDQ5281385zbMATH OpenFDO

Authors Mathieu Bogaerts

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.1713

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the characterisation of the isometry group of the metric space (Sym(n),d_H) in order to develop generating algorithms with rejection of isomorphic objects. To classify the (n,d)-permutation codes up to isometry, we construct invariants and study their efficiency. We give the numbers of non-isometric (4,3)- and (5,4)- permutation codes. Maximal and balanced (n,d)-permutation codes are enumerated in a constructive way.

Cited in

(3)

• A bound on permutation codes
• Two Constructions of Permutation Arrays
• Permutation codes invariant under isometries

This page was built for publication: Isometries and Construction of Permutation Arrays

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