Codes in Permutations and Error Correction for Rank Modulation
From MaRDI portal
Publication:5281383
DOI10.1109/TIT.2010.2048455zbMath1366.94657arXiv0908.4094OpenAlexW2128970384MaRDI QIDQ5281383
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.4094
Bounds on codes (94B65) Combinatorial codes (94B25) Modulation and demodulation in information and communication theory (94A14)
Related Items (14)
Sorting on graphs by adjacent swaps using permutation groups ⋮ Restriction conditions on \(\mathrm{PL}(7, 2)\) codes \((3 \le \vert\mathcal{G}_i\vert \le 7)\) ⋮ Consolidation for compact constraints and Kendall tau LP decodable permutation codes ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric ⋮ Voting rules as error-correcting codes ⋮ Coding for locality in reconstructing permutations ⋮ 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 ⋮ On maximum Lee distance codes ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
This page was built for publication: Codes in Permutations and Error Correction for Rank Modulation