Distance preserving mappings from ternary vectors to permutations

Details Distance preserving mappings from ternary vectors to permutations Distance preserving mappings from ternary vectors to permutations

2007-04-11

arxiv.org/abs/0704.1358v1

Computer Science

Discrete Mathematics

21 pages

Scientific paper

Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger Hamming distance than that of the vectors. In this paper, we propose a construction of DPMs from ternary vectors. The constructed DPMs improve the lower bounds on the maximal size of permutation arrays.

Affiliated with

Also associated with

No associations

Rating

Distance preserving mappings from ternary vectors to permutations 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 Distance preserving mappings from ternary vectors to permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance preserving mappings from ternary vectors to permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-672882