Simple distance-preserving mappings from ternary vectors to permutations

Abstract

We give a simple construction of distance-preserving Mappings from ternary vectors to permutations (3-DPM). Our result gives a lower bound for permutation arrays, i.e., P(n, d) >= A(3)(n, d), which significantly improves previous lower bounds for d <= 3n/5.