Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

68

Voted

APPROX
2005
Springer

favoriteEmaildiscussreport

75views Algorithms» more APPROX 2005»

The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem

15 years 4 months ago

The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem

Download cseweb.ucsd.edu

Vadim Lyubashevsky

Real-time Traffic

Algorithms | APPROX 2005 |

claim paper

Related Content

» Noisetolerant learning the parity problem and the statistical query model

» Message passing algorithms and improved LP decoding

» Network Codes Resilient to Jamming and Eavesdropping

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	APPROX
Authors	Vadim Lyubashevsky

Comments (0)