A recursive construction of t‐wise uniform permutations |
| |
| Authors: | Hilary Finucane Ron Peled Yariv Yaari |
| |
| Affiliation: | 1. Massachusetts Institute of Technology, Cambridge, MA;2. Tel Aviv University, Tel Aviv Israel;3. Weizmann Institute of Science, Rehovot Israel |
| |
| Abstract: | We present a recursive construction of a (2t + 1)‐wise uniform set of permutations on 2n objects using a  combinatorial design, a t‐wise uniform set of permutations on n objects and a (2t + 1)‐wise uniform set of permutations on n objects. Using the complete design in this procedure gives a t‐wise uniform set of permutations on n objects whose size is at most t2n, the first non‐trivial construction of an infinite family of t‐wise uniform sets for  . If a non‐trivial design with suitable parameters is found, it will imply a corresponding improvement in the construction. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 531–540, 2015 |
| |
| Keywords: | t‐wise permutation combinatorial design recursive construction |
|
|
