Isometries and Construction of Permutation Arrays
From MaRDI portal
Publication:5281385
DOI10.1109/TIT.2010.2048449zbMATH Open1366.94659arXiv0911.1713MaRDI QIDQ5281385FDOQ5281385
Authors: Mathieu Bogaerts 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0911.1713
Cited In (3)
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)
