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) ≥ A3 (n,d), which significantly improves previous lower bounds for ≤ 3n/5.
Original language | English |
---|---|
Pages (from-to) | 3251-3256 |
Number of pages | 6 |
Journal | IEEE Transactions on Information Theory |
Volume | 54 |
Issue number | 7 |
DOIs | |
State | Published - 1 Jul 2008 |
Keywords
- Code constructions
- Distance-preserving mappings
- Permutation arrays
- Ternary codes