On the minimum weight problem of permutation codes under Chebyshev distance

Details On the minimum weight problem of permutation codes under Chebyshev distance On the minimum weight problem of permutation codes under Chebyshev distance

2010-05-31

arxiv.org/abs/1005.5591v1

Computer Science

Information Theory

5 pages. ISIT 2010

Scientific paper

Permutation codes of length $n$ and distance $d$ is a set of permutations on $n$ symbols, where the distance between any two elements in the set is at least $d$. Subgroup permutation codes are permutation codes with the property that the elements are closed under the operation of composition. In this paper, under the distance metric $\ell_{\infty}$-norm, we prove that finding the minimum weight codeword for subgroup permutation code is NP-complete. Moreover, we show that it is NP-hard to approximate the minimum weight within the factor $7/6-\epsilon$ for any $\epsilon>0$.

Affiliated with

Also associated with

No associations

Rating

On the minimum weight problem of permutation codes under 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 On the minimum weight problem of permutation codes under Chebyshev distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimum weight problem of permutation codes under Chebyshev distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627371