The complexity of the Weight Problem for permutation groups

Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N . In this paper we show that this problem is NP-complete for many well known metrics.