par Bogaerts, Mathieu 
Référence IEEE transactions on information theory, 56, 7, page (3177-3179), 5484992
Publication Publié, 2010-07
Référence IEEE transactions on information theory, 56, 7, page (3177-3179), 5484992
Publication Publié, 2010-07
Article révisé par les pairs
| Résumé : | An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance dH between any two distinct elements of C is at least equal to d. In this paper, we use the characterization of the isometry group of the metric space (Sym(n),dH) 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 nonisometric (4,3) - and (5,4)- permutation codes. Maximal and balanced (n,d)-permutation codes are enumerated in a constructive way. © 2006 IEEE. |
