@inproceedings{271b31c8c473424c83a2eff0fcf46450,
title = "Quickest sequence phase detection",
abstract = "We consider the problem of designing a length-n binary sequence, such that the location of any length-k contiguous subsequence can be determined from a noisy observation of that subsequence. We derive bounds on the minimal possible k in the limit of n → ∞, and describe some sequence constructions. Both adversarial and probabilistic noise models are addressed. Two applications of the problem include fast positioning and card tricks.",
author = "Lele Wang and Sihuang Hu and Ofer Shayevitz",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",
year = "2016",
month = aug,
day = "10",
doi = "10.1109/ISIT.2016.7541806",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2784--2788",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
address = "الولايات المتّحدة",
}