Simple Distance-Preserving Mappings From Ternary Vectors to Permutations

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) ges A₃ (n, d) , which significantly improves previous lower bounds for d les 3n / 5.