Abstract
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 ∈ ℕ, we present a collection of N = N(n) = (n!)Ω(1) 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 constant composition codes on smaller alphabets, where in these codes 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.
References
V. Benes, Optimal rearrangeable multistage connecting networks, Bell System Technical Journal 43 (1964), 1646–1656.
P. J. Cameron, Permutation codes, European Journal of Combinatorics 31 (2010), 482–490.
Y. M. Chee and P. Purkayastha, Efficient decoding of permutation codes obtained from distance preserving maps, in 2012 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, Piscataway, NJ, 2012, pp. 636–640.
W. Chu, C. J. Colbourn and P. Dukes, On constant composition codes, Discrete Applied Mathematics 154 (2006), 912–929.
O. Goldreich and A. Wigderson, Robustly self-ordered graphs: Constructions and applications to property testing, in 36th Computational Complexity Conference, Leibniz International Proceedings in Informatics, Vol. 200, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Wadern, 2021, Article no. 12.
F. H. Hunt, S. Perkins and D. S. Smith, Decoding mixed errors and erasures in permutation codes, Designs, Codes and Cryptography 74 (2015), 481–493.
D. Slepian, Permutation modulation, Proceeding of the IEEE 53 (1965), 228–236.
L. G. Valiant, A scheme for fast parallel communication, SIAM Journal on Computing 11 (1982), 350–361.
L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, in STOC’ 81: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1981, pp. 263–277.
Acknowledgement
We are grateful to Venkatesan Guruswami for extremely useful discussions regarding Section 5. In particular, Theorem 6 answers a question that he suggested.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Nati Linial, a visionary and a mensch, on the occasion of his 70th birthday
Partially supported by the Israel Science Foundation (grant No. 1041/18) and by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 819702).
Research partially supported by NSF grant CCF-1900460
Rights and permissions
About this article
Cite this article
Goldreich, O., Wigderson, A. Good permutation codes based on the shuffle-exchange network. Isr. J. Math. 256, 283–296 (2023). https://doi.org/10.1007/s11856-023-2498-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-023-2498-4