用简单映射算法构造全长距离增加映射
Distance-Increasing Maps of All Length by Simple Mapping Algorithms
摘要:
从二元向量到置换的距离增加映射,即DIM,对于构造置换阵列很有用。虽然定义偶数长度的DIM的简单映射算法是已知的,但是现有的奇数长度的DIM或者通过合并较短的DIM来递归地构造,或者通过非常复杂的映射算法来定义。本文提出了由简单映射算法定义的任意长度的DIM。
英文摘要:
Distance-increasing maps from binary vectors to permutations, namely DIMs, are useful for the construction of permutation arrays. While a simple mapping algorithm defining DIMs of even length is known, existing DIMs of odd length are either recursively constructed by merging shorter DIMs or defined by much complicated mapping algorithms. In this paper, DIMs of all length defined by simple mapping algorithms are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。