Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
From MaRDI portal
Publication:2977425
DOI10.1109/TIT.2015.2424701zbMath1359.94784MaRDI QIDQ2977425
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (12)
New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3 ⋮ Perfect codes from \(\operatorname{PGL}(2,5)\) in star graphs ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric ⋮ Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Proof of a conjecture of Kløve on permutation codes under the Chebychev distance ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation ⋮ New theoretical bounds and constructions of permutation codes under block permutation metric
This page was built for publication: Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
