On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations
Designs, Codes and Cryptography
A random construction for permutation codes and the covering radius
Designs, Codes and Cryptography
New simple constructions of distance-increasing mappings from binary vectors to permutations
Information Processing Letters
Bat chirps with good properties: Zak space construction of perfect polyphase sequences
IEEE Transactions on Information Theory
A new collision-free pseudonym scheme in mobile ad hoc networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Correcting limited-magnitude errors in the rank-modulation scheme
IEEE Transactions on Information Theory
Isometries and construction of permutation arrays
IEEE Transactions on Information Theory
An image encryption algorithm based on small permutation array combining
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
| Hi-index | 755.02 |
A permutation array (PA) of length n and minimum distance d is a set of permutations of n elements such that any two permutations coincide in at most n - d positions. Some constructions of PAs are given