Cart (Loading....) | Create Account
Close category search window
 

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
$31 $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 ; Intell. Inf. & Commun. Res. Center, Nat. Chiao Tung Univ., 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:

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

Date of Publication:

Nov. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.