Good permutation codes based on the shuffle-exchange network

Oded Goldreich, Avi Wigderson*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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.

Original languageEnglish
Pages (from-to)283-296
Number of pages14
JournalIsrael Journal of Mathematics
Volume256
Issue number1
DOIs
StatePublished - Sep 2023
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2023, The Hebrew University of Jerusalem.

Fingerprint

Dive into the research topics of 'Good permutation codes based on the shuffle-exchange network'. Together they form a unique fingerprint.

Cite this