Good permutation codes based on the shuffle-exchange network

DOI10.1007/S11856-023-2498-4MaRDI QIDQ6076193zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, A. Wigderson

Publication date 23 October 2023

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11856-023-2498-4

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Analysis of algorithms and problem complexity (68Q25) Other types of codes (94B60)

Recommendations

• Constructions for permutation codes in powerline communications
• Permutation codes with specified packing radius
• A new table of permutation codes
• Constructing permutation arrays using partition and extension
• Coding for locality in reconstructing permutations

Cites work

• A Scheme for Fast Parallel Communication
• Decoding mixed errors and erasures in permutation codes
• On constant composition codes
• Optimal Rearrangeable Multistage Connecting Networks
• Permutation codes
• Robustly self-ordered graphs: constructions and applications to property testing

Cited in

(1)

• Diametric problem for permutations with the Ulam metric (optimal anticodes)

This page was built for publication: Good permutation codes based on the shuffle-exchange network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076193)