Shift Finding in Sub-linear Time

Shift Finding in Sub-linear Time

We study the following basic pattern matching problem. Consider a "code" sequence c consisting of n bits chosen uniformly at random, and a "signal" sequence x obtained by shifting c (modulo n) and adding noise. The goal is to efficiently recover the shift with high probability. T...

Full description

Bibliographic Details
Main Authors: Andoni, Alexandr (Author), Hassanieh, Haitham (Contributor), Indyk, Piotr (Contributor), Katabi, Dina (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2014-05-15T14:02:22Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items