Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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.
['Jyh-Shyan Lin', 'Jen-Chun Chang', 'Rong-Jaye Chen']
I am writing a research paper on a idea New simple constructions of distance-increasing mappings from binary vectors to permutations
[{"from": "human", "value": "I am writing a research paper on a idea New simple constructions of distance-increasing mappings from binary vectors to permutations"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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."}]