A generalized upper bound and a multilevel construction. for distance-preserving mappings
A new general upper bound is derived on the sum of the Hamming distances between sequences when mapping from one set of sequences to another. It is shown that a similar upper bound for mappings from binary sequences to permutation sequences is a special case of this upper bound and this is used to evaluate known mappings. Also, new distance-preserving mappings (DPMs) from binary sequences to permutation sequences are presented, based on a multilevel construction. In addition to explicit distance-conserving mappings, distance-increasing, and distance-reducing mappings are also presented. Several of the new DPMs attain the upper bound.
hamming distance distance-preserving mappings (dpms) code constructions distance bounds permutation coding