C++ parallel permutation matrix generation algorithm. The CPU version is actually slower that the STL permutation iterator, but the CUDA version that is meant for the ArrayFire library is order or two ...

An array of n items has n! possible unique permutations, assuming n contains unique elements. Generating random permutations is useful for many applications where a random ordering of a set of items ...

This study proposes a novel color image encryption algorithm based on a 3D chaotic Hopfield neural network and random row–column permutation. First, a 3D chaotic Hopfield neural network is proposed to ...

Abstract: This paper provides a new way to generate permutations of a given input in lesser time using the concept of parallel programming. More than forty algorithms have been proposed to date for ...

Quantum algorithms can afford greater computational efficiency compared to their classical counterparts when addressing specific computing tasks. We describe here the implementation, using a polar ...

Abstract: Two linear codes are permutation-equivalent if they are equal up to a fixed permutation on the codeword coordinates. We present here an algorithm able to compute this permutation. It ...