Published 2018
| Version v1
Journal article
The Complexity of Bit Retrieval
- 1. Cornell University, Ithaca, NY (United States). Dept. of Physics
Description
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.
Availability note (English)
Available from http://www.osti.gov/pages/biblio/1417635; DOE Accepted Manuscript full text, or the publishers Best Available Version will be available free of charge after the embargo periodAdditional details
Identifiers
Publishing Information
- Journal Title
- IEEE Transactions on Information Theory
- Journal Volume
- 64
- Journal Issue
- 1
- Journal Page Range
- p. 412-428
- ISSN
- 0018-9448
INIS
- Country of Publication
- United States
- Country of Input or Organization
- United States
- INIS RN
- 49062688
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- ALGORITHMS; PERIODICITY; X RADIATION
- Descriptors DEC
- ELECTROMAGNETIC RADIATION; IONIZING RADIATIONS; MATHEMATICAL LOGIC; RADIATIONS; VARIATIONS
Optional Information
- Contract/Grant/Project number
- SC0005827; AC02-76SF00515; FG02-11ER16210
- Funding organization
- USDOE (United States); Simons Foundation (United States)
- Secondary number(s)
- OSTIID--1417635