The complexity of bit retrieval
Data Structures and Algorithms
2016-01-15 v1 Combinatorics
Numerical Analysis
Optimization and Control
Abstract
Bit retrieval is the problem of reconstructing a binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.
Cite
@article{arxiv.1601.03428,
title = {The complexity of bit retrieval},
author = {Veit Elser},
journal= {arXiv preprint arXiv:1601.03428},
year = {2016}
}
Comments
42 pages, 15 figures