Sciweavers

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

11

FOCS
2006
IEEE

favoriteEmaildiscussreport

98views Theoretical Computer Science» more FOCS 2006»

Subspace Polynomials and List Decoding of Reed-Solomon Codes

13 years 10 months ago

Subspace Polynomials and List Decoding of Reed-Solomon Codes

Download www.cs.technion.ac.il

Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakr

Real-time Traffic

FOCS 2006 | Theoretical Computer Science |

claim paper

Related Content

» Efficient Factorisation Algorithm for List Decoding AlgebraicGeometric and ReedSolomon Cod...

» Linear Diophantine Equations over Polynomials and Soft Decoding of ReedSolomon Codes

» Instruction Set Extensions for ReedSolomon Encoding and Decoding

» Limits to list decoding ReedSolomon codes

» Iterative algebraic softdecision list decoding of ReedSolomon codes

» Performance Analysis of Algebraic SoftDecision Decoding of ReedSolomon Codes

» Complexity of Decoding PositiveRate ReedSolomon Codes

» Cryptographic Hardness Based on the Decoding of ReedSolomon Codes

» Finding roots of polynomials over finite fields

Post Info
More Details (n/a)

Added	11 Jun 2010
Updated	11 Jun 2010
Type	Conference
Year	2006
Where	FOCS
Authors	Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan

Comments (0)