By Topic

Inapproximability Results for the Weight Problems of Subgroup Permutation Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Min-Zheng Shieh ; Intelligent Information and Communications Research Center, National Chiao Tung University, Hsinchu, Taiwan ; Shi-Chun Tsai

A subgroup permutation code is a set of permutations on n symbols with the property that its elements are closed under the operation of composition. In this paper, we give inapproximability results for the minimum and maximum weight problems of subgroup permutation codes under several well-known metrics. Based on previous works, we prove that under Hamming, Lee, Cayley, Kendall's tau, Ulam's, and lp distance metrics, 1) there is no polynomial-time 2log1-εn-approximation algorithm for the minimum weight problem for any constant ε >; 0 unless NP ⊆ DTIME(2polylog(n)) (quasi-polynomial time), and 2) there is no polynomial-time r-approximation algorithm for the minimum weight problem for any constant r >; 1 unless P = NP. Under l-metric, we prove that it is NP-hard to approximate the minimum weight problem within factor 2-ε for any constant ε >; 0. We also prove that for any constant ε >; 0, it is NP-hard to approximate the maximum weight within p √{[ 3/ 2]}-ε under ℓp distance metric, and within [ 3/ 2]-ε under Hamming, Lee, Cayley, Kendall's tau, and Ulam's distance metrics.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 11 )