標題: On the minimum weight problem of permutation codes under Chebyshev distance
作者: Shieh, Min-Zheng
Tsai, Shi-Chun
資訊工程學系
Department of Computer Science
公開日期: 2010
摘要: 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 l(infinity)-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.
URI: http://hdl.handle.net/11536/26632
http://dx.doi.org/10.1109/ISIT.2010.5513663
ISBN: 978-1-4244-6960-4
DOI: 10.1109/ISIT.2010.5513663
期刊: 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY
起始頁: 1183
結束頁: 1187
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000287512700238.pdf