Perfect Snake-in-the-Box Codes for Rank Modulation

DOI10.1109/TIT.2016.2620160zbMath1359.94798arXiv1602.08073OpenAlexW2963304363MaRDI QIDQ2979080

Alexander E. Holroyd

Publication date: 2 May 2017

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

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

Mathematics Subject Classification ID

Combinatorial codes (94B25) Modulation and demodulation in information and communication theory (94A14)

Related Items (7)

Isomorphism of maximum length circuit codes ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Unnamed Item ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation ⋮ Gray codes and symmetric chains ⋮ Sparse Kneser graphs are Hamiltonian

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