Sciweavers

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

31

TIT
2008

favoriteEmaildiscussreport

68views more TIT 2008»

On the Hardness of Decoding the Gale-Berlekamp Code

13 years 10 months ago

On the Hardness of Decoding the Gale-Berlekamp Code

Download www.cs.technion.ac.il

The Gale

Ron M. Roth, Krishnamurthy Viswanathan

Real-time Traffic

Binary Product Code | Code | TIT 2008 | Vertical Constituent Codes |

claim paper

Related Content

» Linear time approximation schemes for the GaleBerlekamp game and related minimization prob...

» Multiple Antenna Assisted Hard Versus Soft DecodingandForwarding for Network Coding Aided ...

» Decoding Random Binary Linear Codes in 2 n20 How 1 1 0 Improves Information Set Decoding

» Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline C...

» Proving HardCore Predicates Using List Decoding

» Cryptographic Hardness Based on the Decoding of ReedSolomon Codes

» Uniform Hardness Amplification in NP via Monotone Codes

» Complexity of Decoding PositiveRate ReedSolomon Codes

» Approximately ListDecoding Direct Product Codes and Uniform Hardness Amplification

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TIT
Authors	Ron M. Roth, Krishnamurthy Viswanathan

Comments (0)