Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network

We consider the problem of efficiently constructing an as large as possible family of permutations such that each pair of permutations are far part (i.e., disagree on a constant fraction of their inputs). Specifically, for every n ∈ N, we present a collection of N = N(n) = (n!) pairwise far apart permutations {πi : [n] → [n]}i∈[N ] and a polynomial-time algorithm that on input i ∈ [N ] outputs an explicit description of πi. From a coding theoretic perspective, we construct permutation codes of constant relative distance and constant rate along with efficient encoding (and decoding) algorithms. This construction is easily extended to produce codes on smaller alphabets in which every codeword is balanced; namely, each symbol appears the same number of times. Our construction combines routing on the Shuffle-Exchange network with any good binary error correcting code. Specifically, we uses codewords of a good binary code in order to determine the switching instructions in the Shuffle-Exchange network.

[1]  V. Benes Optimal rearrangeable multistage connecting networks , 1964 .

[2]  Yeow Meng Chee,et al.  Efficient decoding of permutation codes obtained from distance preserving maps , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[3]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[4]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[5]  Derek H. Smith,et al.  Decoding mixed errors and erasures in permutation codes , 2015, Des. Codes Cryptogr..

[6]  Avi Wigderson,et al.  Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing , 2020, Electron. Colloquium Comput. Complex..

[7]  D. Slepian Permutation Modulation , 1965, Encyclopedia of Wireless Networks.

[8]  Peter J. Cameron,et al.  Permutation codes , 2010, Eur. J. Comb..

[9]  Charles J. Colbourn,et al.  On constant composition codes , 2006, Discret. Appl. Math..