標題: New simple constructions of distance-increasing mappings from binary vectors to permutations
作者: Lin, Jyh-Shyan
Chang, Jen-Chun
Chen, Rong-Jaye
資訊工程學系
Department of Computer Science
關鍵字: combinatorial problems;distance-preserving mappings;distance-increasing mappings;permutation arrays;hamming distance
公開日期: 31-十月-2006
摘要: Distance-increasing mappings (DIMs) are mappings from the set of binary vectors of a fixed length to the set of permutations of the same length that increase Hamming distances except when that is obviously not possible. In this paper, we propose new non-recursive constructions of DIMs which are based on simple compositions of permutations. In comparison with Chang's constructions, our new constructions do not need any table-lookup operations, and usually have better distance expansion distributions when the length is odd. (c) 2006 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.ipl.2005.09.019
http://hdl.handle.net/11536/11651
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.09.019
期刊: INFORMATION PROCESSING LETTERS
Volume: 100
Issue: 2
起始頁: 83
結束頁: 89
顯示於類別:期刊論文


文件中的檔案:

  1. 000240296300009.pdf

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