The Complexity of Bit Retrieval
Journal Article
·
· IEEE Transactions on Information Theory
Bit retrieval is the problem of reconstructing a periodic 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.
- Research Organization:
- SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States)
- Sponsoring Organization:
- USDOE; Simons Foundation
- Grant/Contract Number:
- SC0005827; AC02-76SF00515; SC0005827
- OSTI ID:
- 1417635
- Journal Information:
- IEEE Transactions on Information Theory, Journal Name: IEEE Transactions on Information Theory Journal Issue: 1 Vol. 64; ISSN 0018-9448
- Publisher:
- IEEECopyright Statement
- Country of Publication:
- United States
- Language:
- English
The Douglas–Rachford algorithm for convex and nonconvex feasibility problems
|
journal | November 2019 |
Similar Records
Phase Retrieval from Modulus Using Homeomorphic Signal Processing and the Complex Cepstrum: An Algorithm for Lightning Protection Systems
One-dimensional phase retrieval: Regularization, box relaxation and uniqueness
Phase retrieval from the power spectrum of a periodic object
Technical Report
·
2004
·
OSTI ID:15014444
One-dimensional phase retrieval: Regularization, box relaxation and uniqueness
Journal Article
·
2020
· Inverse Problems
·
OSTI ID:1713246
+1 more
Phase retrieval from the power spectrum of a periodic object
Journal Article
·
1992
· Journal of the Optical Society of America, Part A: Optics and Image Science; (United States)
·
OSTI ID:6697782