標題: Distance-preserving and distance-increasing mappings from ternary vectors to permutations
作者: Lin, Jyh-Shyan
Chang, Jen-Chun
Chen, Rong-Jaye
Klove, Torleiv
資訊工程學系
Department of Computer Science
關鍵字: distance-increasing mappings;distance-preserving mappings;permutation arrays;powerline communication
公開日期: 1-三月-2008
摘要: Permutation 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.
URI: http://dx.doi.org/10.1109/TIT.2007.915706
http://hdl.handle.net/11536/9641
ISSN: 0018-9448
DOI: 10.1109/TIT.2007.915706
期刊: IEEE TRANSACTIONS ON INFORMATION THEORY
Volume: 54
Issue: 3
起始頁: 1334
結束頁: 1339
顯示於類別:期刊論文


文件中的檔案:

  1. 000253602200033.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。