Sample Complexity of the Boolean Multireference Alignment Problem
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SD5FI4MMrecord.jsonopen to challenge →
classification
cs.IT
math.IT
keywords
signalbooleanalignmentdimensionsexpressionmultireferenceproblemautocorrelations
read the original abstract
The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This expression is used to characterize the number of measurements needed for signal recovery in the low SNR regime, in terms of higher order autocorrelations of the signal. The characterization is explicit for various signal dimensions, such as prime and even dimensions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.