Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Jyh-Shyanen_US
dc.contributor.authorChang, Jen-Chunen_US
dc.contributor.authorChen, Rong-Jayeen_US
dc.contributor.authorKlove, Torleiven_US
dc.date.accessioned2014-12-08T15:12:33Z-
dc.date.available2014-12-08T15:12:33Z-
dc.date.issued2008-03-01en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TIT.2007.915706en_US
dc.identifier.urihttp://hdl.handle.net/11536/9641-
dc.description.abstractPermutation arrays have found applications in powerline communication. One construction method for permutation arrays is to map good codes to permutations using a distance-preserving mappings (DPM). DPMs are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of some fixed length (the same or longer) such that every two distinct vectors are mapped to permutations with the same or larger Hamming distance than that of the vectors. A DIM is called distance increasing (DIM) if the distances are strictly increased (except when the two vectors are equal). In this correspondence, we propose constructions of DPMs and DIMs from ternary vectors. The constructed DPMs and DIMs improve many lower bounds on the maximal size of permutation arrays.en_US
dc.language.isoen_USen_US
dc.subjectdistance-increasing mappingsen_US
dc.subjectdistance-preserving mappingsen_US
dc.subjectpermutation arraysen_US
dc.subjectpowerline communicationen_US
dc.titleDistance-preserving and distance-increasing mappings from ternary vectors to permutationsen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TIT.2007.915706en_US
dc.identifier.journalIEEE TRANSACTIONS ON INFORMATION THEORYen_US
dc.citation.volume54en_US
dc.citation.issue3en_US
dc.citation.spage1334en_US
dc.citation.epage1339en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000253602200033-
dc.citation.woscount8-
Appears in Collections:Articles


Files in This Item:

  1. 000253602200033.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.