ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
20
views
15
references
Top references
cited by
75
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,841
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
One-Bit Compressed Sensing by Linear Programming
Author(s):
Yaniv Plan
,
Roman Vershynin
Publication date
Created:
August 2013
Publication date
(Print):
August 2013
Journal:
Communications on Pure and Applied Mathematics
Publisher:
Wiley-Blackwell
Read this article at
ScienceOpen
Publisher
Further versions
oa repository (via OAI-PMH doi match)
oa repository (via OAI-PMH title and first author match)
oa repository (via OAI-PMH title and first author match)
Powered by
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
Stable signal recovery from incomplete and inaccurate measurements
Emmanuel Candès
,
Justin Romberg
,
Terence Tao
(2006)
0
comments
Cited
1063
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel Candès
,
Terence Tao
(2006)
0
comments
Cited
916
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans
,
David P. Williamson
(1995)
0
comments
Cited
424
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Communications on Pure and Applied Mathematics
Abbreviated Title:
Comm. Pure Appl. Math.
Publisher:
Wiley-Blackwell
ISSN:
00103640
Publication date Created:
August 2013
Publication date (Print):
August 2013
Volume
: 66
Issue
: 8
Pages
: 1275-1297
Article
DOI:
10.1002/cpa.21442
SO-VID:
9807f29e-c4aa-469f-b9c2-886a401faa85
Copyright ©
© 2013
License:
http://doi.wiley.com/10.1002/tdm_license_1.1
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
2,841
Blind Estimation of Sparse Broadband Massive MIMO Channels With Ideal and One-bit ADCs
Authors:
Amine Mezghani
,
A. Lee Swindlehurst
An 8.2 fJ/conversion-step 9-bit 135 MS/s SAR ADC with redundant methods for acceleration
Authors:
Yongzhen Chen
,
Fan Ye
,
Junyan Ren
A novel fuzzy c-means approach with bit plane algorithm for classification of medical images
Authors:
See all similar
Cited by
75
Quantized Massive MU-MIMO-OFDM Uplink
Authors:
Christoph Studer
,
Giuseppe Durisi
One-Bit Compressive Sensing With Norm Estimation
Authors:
Rayan Saab
,
Rachel Ward
,
Karin Knudson
Estimation in High Dimensions: A Geometric Perspective
Authors:
Roman Vershynin
See all cited by
Most referenced authors
102
E. S. Boyd
D Williamson
T. Tao
See all reference authors