@article{76617f5c743a4b318fb4cd7f8d73230a,
title = "Quickest Sequence Phase Detection",
abstract = "A phase detection sequence is a length- n cyclic sequence, such that the location of any length- k contiguous subsequence can be determined from a noisy observation of that subsequence. In this paper, we derive bounds on the minimal possible k in the limit of n , and describe some sequence constructions. We further consider multiple phase detection sequences, where the location of any length- k contiguous subsequence of each sequence can be determined simultaneously from a noisy mixture of those subsequences. We study the optimal trade-offs between the lengths of the sequences, and describe some sequence constructions. We compare these phase detection problems to their natural channel coding counterparts, and show a strict separation between the fundamental limits in the multiple sequence case. Both adversarial and probabilistic noise models are addressed.",
keywords = "De Bruijn sequence, Lov{\'a}sz local lemma, adversarial noise, linear feed-back shift register, multiple access channel, positioning system, probabilistic noise, zero-error capacity",
author = "Lele Wang and Sihuang Hu and Ofer Shayevitz",
note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",
year = "2017",
month = sep,
doi = "10.1109/TIT.2017.2705159",
language = "אנגלית",
volume = "63",
pages = "5834--5849",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",
}