Isometries and Construction of Permutation Arrays

Details Isometries and Construction of Permutation Arrays Isometries and Construction of Permutation Arrays

2009-11-09

arxiv.org/abs/0911.1713v1

Mathematics

Combinatorics

6 pages, 2 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Isometries and Construction of Permutation Arrays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Isometries and Construction of Permutation Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isometries and Construction of Permutation Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-660492