Distance preserving mappings from ternary vectors to permutations

Simple item page
dc.creatorLin, Jyh-Shyan
dc.creatorChang, Jen-Chun
dc.creatorChen, Rong-Jaye
dc.creatorKløve, Torleiv
dc.date2007-04-11
dc.date.accessioned2026-07-07T08:15:56Z
dc.date.available2026-07-07T08:15:56Z
dc.descriptionDistance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger Hamming distance than that of the vectors. In this paper, we propose a construction of DPMs from ternary vectors. The constructed DPMs improve the lower bounds on the maximal size of permutation arrays.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/0704.1358
dc.identifierhttp://arxiv.org/abs/0704.1358
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133610
dc.subjectDiscrete Mathematics
dc.subjectInformation Theory
dc.titleDistance preserving mappings from ternary vectors to permutations
dc.typetext

Files

Collections

arXiv