|
Problemy Peredachi Informatsii, 2012, Volume 48, Issue 2, Pages 121–126
(Mi ppi2080)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Large Systems
Reconstruction of cyclic words from their fragments
V. K. Leont'ev Computing Center of the Russian Academy of Sciences, Moscow
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.
Received: 01.06.2010 Revised: 29.02.2012
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
Linking options:
https://www.mathnet.ru/eng/ppi2080 https://www.mathnet.ru/eng/ppi/v48/i2/p121
|
|