Abstract
Abstract:
A multilevel construction is introduced to create distance-preserving mappings from binary sequences to permutation sequences. It is also shown that for certain values, the new mappings attain the
upper bound on the sum of Hamming distances obtainable for such mappings, and in the other cases improve on those of previous mappings.