Search Menu
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information
Search Scholarly Publications

Title: The Complexity of Bit Retrieval

Journal Article · · IEEE Transactions on Information Theory
ORCiD logo [1]
  1. Cornell Univ., Ithaca, NY (United States). Dept. of Physics
+ Show Author Affiliations

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; FG02-11ER16210
OSTI ID:
1417635
Journal Information:
IEEE Transactions on Information Theory, Vol. 64, Issue 1; ISSN 0018-9448
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 9 works
Citation information provided by
Web of Science

Cited By (1)

The Douglas–Rachford algorithm for convex and nonconvex feasibility problems journal November 2019

Figures / Tables (15)

Figure 1(p. 11)figure Figure 1
Figure 2(p. 14)figure Figure 2
Figure 3(p. 19)figure Figure 3
Figure 4(p. 22)figure Figure 4
Figure 5(p. 23)figure Figure 5
Figure 6(p. 25)figure Figure 6
Figure 7(p. 25)figure Figure 7
Figure 8(p. 26)figure Figure 8
Figure 9(p. 29)figure Figure 9
Figure 10(p. 31)figure Figure 10
Figure 11(p. 32)figure Figure 11
Figure 12(p. 33)figure Figure 12
Figure 13(p. 35)figure Figure 13
Figure 14(p. 36)figure Figure 14
Figure 15(p. 37)figure Figure 15

Similar Records

Related Subjects

97 MATHEMATICS AND COMPUTING
Phase retrieval
periodic autocorrelation
reconstruction algorithms