Simple distance-preserving mappings from ternary vectors to permutations

Te Tsung Lin*, Shi-Chun Tsai, Hsin Lung Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 languageEnglish
Pages (from-to)3251-3256
Number of pages6
JournalIEEE Transactions on Information Theory
Volume54
Issue number7
DOIs
StatePublished - 1 Jul 2008

Keywords

  • Code constructions
  • Distance-preserving mappings
  • Permutation arrays
  • Ternary codes

Cite this