Improved Bounds for Permutation Arrays Under Chebyshev Distance

DOI10.1007/S10623-023-01326-1MaRDI QIDQ6427570zbMATH OpenFDO

Authors Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, I. H. Sudborough

Publication date 24 February 2023

Full work available at URL https://doi.org/10.1007/S10623-023-01326-1

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Bounds on codes (94B65) Other types of codes (94B60)

Abstract: Permutation arrays under the Chebyshev metric have been considered for error correction in noisy channels. Let $P(n,d)$ denote the maximum size of any array of permutations on $n$ symbols with pairwise Chebyshev distance $d$. We give new techniques and improved upper and lower bounds on $P(n,d)$, including a precise formula for $P(n,2)$.

Recommendations

• Improved lower bounds for permutation arrays using permutation rational functions
• Bounds on permutation codes of distance four
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Upper bounds on permutation codes via linear programming
• Constructions of permutation arrays

This page was built for publication: Improved Bounds for Permutation Arrays Under Chebyshev Distance

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