標題: Distance-preserving mappings from binary vectors to permutations
作者: Chang, JC
Chen, RJ
Klove, T
Tsai, SC
資訊工程學系
Department of Computer Science
關鍵字: code constructions;distance;mapping;permutation arrays (PAs)
公開日期: 1-Apr-2003
摘要: Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length are useful for the construction of permutation codes. In this correspondence, several explicit constructions of such mappings preserving or increasing the Hamming distance are given. Some applications are given to illustrate the usefulness (if the construction. In particular, a new lower bound on the maximal size of permutation arrays (PAs) is given.
URI: http://dx.doi.org/10.1109/TIT.2003.809507
http://hdl.handle.net/11536/27984
ISSN: 0018-9448
DOI: 10.1109/TIT.2003.809507
期刊: IEEE TRANSACTIONS ON INFORMATION THEORY
Volume: 49
Issue: 4
起始頁: 1054
結束頁: 1059
Appears in Collections:Articles


Files in This Item:

  1. 000182169400025.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.