Perfect snake-in-the-box codes for rank modulation
IEEE Trans. Information Theory, Volume abs/1602.08073, Issue 1, 2017, Pages 104-110.
For odd $n$ , the alternating group on $n$ elements is generated by the permutations that jump an element from an odd position to position 1. We prove Hamiltonicity of the associated directed Cayley graph for all odd $n\\neq 5$ (a result of Rankin implies that the graph is not Hamiltonian for $n=5$ ). This solves a problem arising in rank...More
PPT (Upload PPT)