Snake-in-the-Box Codes for Rank Modulation

DOI10.1109/TIT.2012.2196755zbMath1364.94648arXiv1107.3372OpenAlexW2156683452WikidataQ59902921 ScholiaQ59902921MaRDI QIDQ2989856

Moshe Schwartz, Yonatan Yehezkeally

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Modulation and demodulation in information and communication theory (94A14)

Related Items (12)

Isomorphism of maximum length circuit codes ⋮ New formulations and branch-and-cut procedures for the longest induced path problem ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric ⋮ Covering radius of permutation groups with infinity-norm ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation ⋮ Snakes, coils, and single-track circuit codes with spread \(k\) ⋮ Exhaustive search for snake-in-the-box codes

This page was built for publication: Snake-in-the-Box Codes for Rank Modulation