Distance-Increasing Maps of All Length by Simple Mapping Algorithms

Simple item page
dc.creatorLee, Kwankyu
dc.date2005-09-23
dc.date.accessioned2026-07-07T08:15:40Z
dc.date.available2026-07-07T08:15:40Z
dc.descriptionDistance-increasing maps from binary vectors to permutations, namely DIMs, are useful for the construction of permutation arrays. While a simple mapping algorithm defining DIMs of even length is known, existing DIMs of odd length are either recursively constructed by merging shorter DIMs or defined by much complicated mapping algorithms. In this paper, DIMs of all length defined by simple mapping algorithms are presented.
dc.descriptionSubmitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0509073
dc.identifierhttp://arxiv.org/abs/cs/0509073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133520
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleDistance-Increasing Maps of All Length by Simple Mapping Algorithms
dc.typetext

Files

Collections

arXiv