Distance-Increasing Maps of All Length by Simple Mapping Algorithms

Details Distance-Increasing Maps of All Length by Simple Mapping Algorithms Distance-Increasing Maps of All Length by Simple Mapping Algorithms

2005-09-23

arxiv.org/abs/cs/0509073v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory

Scientific paper

Distance-increasing maps from binary vectors to permutations, namely DIMs, are useful for the construction of permutation arrays. While a simple mapping algorithm defining DIMs of even length is known, existing DIMs of odd length are either recursively constructed by merging shorter DIMs or defined by much complicated mapping algorithms. In this paper, DIMs of all length defined by simple mapping algorithms are presented.

Affiliated with

Also associated with

No associations

Rating

Distance-Increasing Maps of All Length by Simple Mapping Algorithms 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-Increasing Maps of All Length by Simple Mapping Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance-Increasing Maps of All Length by Simple Mapping Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-70911