304 research outputs found
Constructions of Snake-in-the-Box Codes for Rank Modulation
Snake-in-the-box code is a Gray code which is capable of detecting a single
error. Gray codes are important in the context of the rank modulation scheme
which was suggested recently for representing information in flash memories.
For a Gray code in this scheme the codewords are permutations, two consecutive
codewords are obtained by using the "push-to-the-top" operation, and the
distance measure is defined on permutations. In this paper the Kendall's
-metric is used as the distance measure. We present a general method for
constructing such Gray codes. We apply the method recursively to obtain a snake
of length for permutations of ,
from a snake of length for permutations of~. Thus, we have
, improving
on the previous known ratio of . By using the general method we also present a direct construction. This
direct construction is based on necklaces and it might yield snakes of length
for permutations of . The direct
construction was applied successfully for and , and hence
.Comment: IEEE Transactions on Information Theor
Sparse Kneser graphs are Hamiltonian
For integers and , the Kneser graph is the
graph whose vertices are the -element subsets of and whose
edges connect pairs of subsets that are disjoint. The Kneser graphs of the form
are also known as the odd graphs. We settle an old problem due to
Meredith, Lloyd, and Biggs from the 1970s, proving that for every ,
the odd graph has a Hamilton cycle. This and a known conditional
result due to Johnson imply that all Kneser graphs of the form
with and have a Hamilton cycle. We also prove that
has at least distinct Hamilton cycles for .
Our proofs are based on a reduction of the Hamiltonicity problem in the odd
graph to the problem of finding a spanning tree in a suitably defined
hypergraph on Dyck words
- …