Quickest sequence phase detection

Lele Wang; Sihuang Hu; Ofer Shayevitz

doi:10.1109/ISIT.2016.7541806

Quickest sequence phase detection

Lele Wang, Sihuang Hu, Ofer Shayevitz

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2784-2788
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541806
State	Published - 10 Aug 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Universitat Pompeu Fabra, Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Funding

Funders	Funder number
Horizon 2020 Framework Programme	639573

Access to Document

10.1109/ISIT.2016.7541806

Cite this

Wang, L., Hu, S., & Shayevitz, O. (2016). Quickest sequence phase detection. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 2784-2788). Article 7541806 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541806

@inproceedings{2508e1a2b8e545fe9def4c5ee264a113,

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 = "ארצות הברית",

}

Wang, L, Hu, S & Shayevitz, O 2016, Quickest sequence phase detection. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541806, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 2784-2788, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10/07/16. https://doi.org/10.1109/ISIT.2016.7541806

Quickest sequence phase detection. / Wang, Lele; Hu, Sihuang; Shayevitz, Ofer.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 2784-2788 7541806 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Quickest sequence phase detection

AU - Wang, Lele

AU - Hu, Sihuang

AU - Shayevitz, Ofer

PY - 2016/8/10

Y1 - 2016/8/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84985916691&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541806

DO - 10.1109/ISIT.2016.7541806

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84985916691

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2784

EP - 2788

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Quickest sequence phase detection

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this