Distance-preserving mappings from binary vectors to permutations
檔案
- 000182169400025.pdf (373.3 KB, Adobe PDF)
日期
2003-04-01
類型
系所
期刊名稱
IEEE TRANSACTIONS ON INFORMATION THEORY
卷期與頁次
第 49 卷第 4 期,頁 1054–1059
ISSN
0018-9448
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
Chang, J., Chen, R., Klove, T., & Tsai, S. (2003). Distance-preserving mappings from binary vectors to permutations. IEEE TRANSACTIONS ON INFORMATION THEORY, 49(4), 1054–1059. https://doi.org/10.1109/TIT.2003.809507
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/27984