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.
Problems of Information Transmission – Springer Journals
Published: Jul 13, 2012
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud