Abstract:
We consider the problem of reconstructing a cyclic word given a set of its fragments. We show that in the case where an unknown word is a cyclic shift of some fixed word with the number of ones in the latter coprime with the word length it suffices to have fragments of length 2.
Citation:
V. K. Leont'ev, “Reconstruction of cyclic words from their fragments”, Probl. Peredachi Inf., 48:2 (2012), 121–126; Problems Inform. Transmission, 48:2 (2012), 193–197