A multi-levels RNG permutation

Abstract

The paper proposes a new general method for producing a multilevel permutation functioning as an m-tree traversal. It is composed of two basic steps: a random number generator of period length equal m to determine which child to traverse, and recursive permutation in which permutated the subtree if found. The test results proved that the suggested method of permutation is successful depending on the correlation measure.