New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric

DOI10.1007/s12095-023-00642-6arXiv2303.02349MaRDI QIDQ6086190

R. Sobhani, Farzad Parvaresh, Fatemeh Jafari, Alireza Abdollahi, Maryam Khatami, Javad Bagherian

Publication date: 9 November 2023

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.02349

zbMATH Keywords

permutation codesrank modulationKendall \(\tau\)-metric

Mathematics Subject Classification ID

Bounds on codes (94B65) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Codes, transforms and the spectrum of the symmetric group
• Upper bounds on permutation codes via linear programming
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• Codes in Permutations and Error Correction for Rank Modulation
• Correcting Charge-Constrained Errors in the Rank-Modulation Scheme

This page was built for publication: New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric