Simple distance-preserving mappings from ternary vectors to permutations

Te Tsung Lin; Shi-Chun Tsai; Hsin Lung Wu

doi:10.1109/TIT.2008.924716

Simple distance-preserving mappings from ternary vectors to permutations

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

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Article › peer-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) ≥ A₃ (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	https://doi.org/10.1109/TIT.2008.924716
State	Published - 1 Jul 2008

Keywords

Code constructions
Distance-preserving mappings
Permutation arrays
Ternary codes

Access to Document

10.1109/TIT.2008.924716

Link to publication in Scopus

Cite this

@article{450b9b0df19e40ed92a193c12efe751a,

title = "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) ≥ A3 (n,d), which significantly improves previous lower bounds for ≤ 3n/5.",

keywords = "Code constructions, Distance-preserving mappings, Permutation arrays, Ternary codes",

author = "Lin, {Te Tsung} and Shi-Chun Tsai and Wu, {Hsin Lung}",

year = "2008",

month = jul,

day = "1",

doi = "10.1109/TIT.2008.924716",

language = "English",

volume = "54",

pages = "3251--3256",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Simple distance-preserving mappings from ternary vectors to permutations

AU - Lin, Te Tsung

AU - Tsai, Shi-Chun

AU - Wu, Hsin Lung

PY - 2008/7/1

Y1 - 2008/7/1

N2 - 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.

AB - 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.

KW - Code constructions

KW - Distance-preserving mappings

KW - Permutation arrays

KW - Ternary codes

UR - http://www.scopus.com/inward/record.url?scp=46749121986&partnerID=8YFLogxK

U2 - 10.1109/TIT.2008.924716

DO - 10.1109/TIT.2008.924716

M3 - Article

AN - SCOPUS:46749121986

VL - 54

SP - 3251

EP - 3256

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

ER -