Back to Results
First PageMeta Content
Theoretical computer science / Information / List decoding / Reed–Solomon error correction / Concatenated error correction code / Forward error correction / Noisy-channel coding theorem / Venkatesan Guruswami / Code / Coding theory / Error detection and correction / Mathematics


Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy∗ Venkatesan Guruswami1† Atri Rudra2‡
Add to Reading List

Document Date: 2008-04-23 08:55:33

Open Document

File Size: 403,81 KB

Share Result on Facebook

Country

Sudan / /

/

Facility

Engineering State University of New York / Engineering University of Washington Seattle / University of Washington / /

IndustryTerm

polynomial time algorithms / list decoding algorithm / heuristic decoding algorithm / /

Organization

University of Washington / Computer Science and Engineering University of Washington Seattle / State University of New York at Buffalo / National Science Foundation / Department of Computer Science / /

Person

Piotr Indyk / Solomon Code / Alex Vardy / Washington Seattle / /

/

Position

rt / author was / /

ProgrammingLanguage

R / C / L / /

PublishedMedium

Theory of Computing / IEEE Transactions on Information Theory / /

Technology

RS list decoding algorithm / improved algorithm / decoding algorithm / polynomial time algorithms / The list decoding algorithm / heuristic decoding algorithm / decoding The list decoding algorithm / /

SocialTag