Sample Complexity of the Boolean Multireference Alignment Problem

Author(s): Abbe, Emmanuel A; Pereira, Joao M; Singer, Amit

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1qt02

Full metadata record

DC Field	Value	Language
dc.contributor.author	Abbe, Emmanuel A	-
dc.contributor.author	Pereira, Joao M	-
dc.contributor.author	Singer, Amit	-
dc.date.accessioned	2018-07-20T15:08:27Z	-
dc.date.available	2018-07-20T15:08:27Z	-
dc.date.issued	2017	en_US
dc.identifier.citation	Abbe, Emmanuel, Pereira, Joao M, Singer, Amit. (2017). Sample Complexity of the Boolean Multireference Alignment Problem. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 1316 - 1320	en_US
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1qt02	-
dc.description.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.	en_US
dc.format.extent	1316 - 1320	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)	en_US
dc.rights	Author's manuscript	en_US
dc.title	Sample Complexity of the Boolean Multireference Alignment Problem	en_US
dc.type	Conference Article	en_US
dc.date.eissued	2017	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1701.07540v2.pdf		116.66 kB	Adobe PDF	View/Download