SIGN IN
SIGN UP
Message passing algorithms and improved LP decoding
Full Text:
PDF
Buy this Article
Authors:
Sanjeev Arora
Princeton University, Princeton, NJ, USA
Constantinos Daskalakis
MIT, Cambridge, MA, USA
David Steurer
Princeton University, Princeton, NJ, USA
Published in:
· Proceeding
STOC '09
Proceedings of the 41st annual ACM symposium on Theory of computing
Pages 3-12
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-506-2
doi>
10.1145/1536414.1536418
2009 Article
Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 76
· Downloads (cumulative): 487
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
ldpc codes
lp decoding
message-passing algorithms
min-sum algorithm
nonnumerical algorithms and problems
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder