Distance preserving mappings from binary vectors to permutations

J. C. Chang; Rong-Jaye Chen; Shi-Chun Tsai; Torleiv Kløve

doi:10.1109/ISIT.2003.1228028

Distance preserving mappings from binary vectors to permutations

J. C. Chang^*, Rong-Jaye Chen, Shi-Chun Tsai, Torleiv Kløve

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length, preserving or increasing the Hamming distance, are useful for the construction of permutation arrays. In this paper, explicit constructions of such mappings are given.

Original language	English
Pages (from-to)	14-14
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/ISIT.2003.1228028
State	Published - 20 Oct 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003

Access to Document

10.1109/ISIT.2003.1228028

Fingerprint Dive into the research topics of 'Distance preserving mappings from binary vectors to permutations'. Together they form a unique fingerprint.

Cite this

@article{2579286bb21a4f4297d177824a88bb14,

title = "Distance preserving mappings from binary vectors to permutations",

abstract = "Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length, preserving or increasing the Hamming distance, are useful for the construction of permutation arrays. In this paper, explicit constructions of such mappings are given.",

author = "Chang, {J. C.} and Rong-Jaye Chen and Shi-Chun Tsai and Torleiv Kl{\o}ve",

year = "2003",

month = oct,

day = "20",

doi = "10.1109/ISIT.2003.1228028",

language = "English",

pages = "14--14",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

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

note = "null ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Distance preserving mappings from binary vectors to permutations

AU - Chang, J. C.

AU - Chen, Rong-Jaye

AU - Tsai, Shi-Chun

AU - Kløve, Torleiv

PY - 2003/10/20

Y1 - 2003/10/20

N2 - Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length, preserving or increasing the Hamming distance, are useful for the construction of permutation arrays. In this paper, explicit constructions of such mappings are given.

AB - Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length, preserving or increasing the Hamming distance, are useful for the construction of permutation arrays. In this paper, explicit constructions of such mappings are given.

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

U2 - 10.1109/ISIT.2003.1228028

DO - 10.1109/ISIT.2003.1228028

M3 - Conference article

AN - SCOPUS:0141939331

SP - 14

EP - 14

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

Y2 - 29 June 2003 through 4 July 2003

ER -