Permutation Arrays Under the Chebyshev Distance

Details Permutation Arrays Under the Chebyshev Distance Permutation Arrays Under the Chebyshev Distance

2009-07-15

arxiv.org/abs/0907.2682v1

Computer Science

Information Theory

14 pages

Scientific paper

An (n,d) permutation array (PA) is a set of permutations of length n with the property that the distance (under some metric) between any two permutations in the array is at least d. They became popular recently for communication over power lines. Motivated by an application to flash memories, in this paper the metric used is the Chebyshev metric. A number of different constructions are given as well as bounds on the size of such PA.

Affiliated with

Also associated with

No associations

Rating

Permutation Arrays Under the Chebyshev Distance 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 Permutation Arrays Under the Chebyshev Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutation Arrays Under the Chebyshev Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365364