Optimal Rate List Decoding via Derivative Codes

DOI10.1007/978-3-642-22935-0_50zbMath1343.94101arXiv1106.3951OpenAlexW2170132953MaRDI QIDQ3088129

Carol J. Wang, Venkatesan Guruswami

Publication date: 17 August 2011

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.3951

zbMATH Keywords

Reed-Solomon codespseudorandomnessnoisy polynomial interpolationmultiplicity codeslist error-correctionsubspace-evasive sets

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (8)

Unnamed Item ⋮ Group homomorphisms as error correcting codes ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability ⋮ Hermite interpolation with error correction. Fields of zero or large characteristic and large error rate ⋮ On list decoding of certain \(\mathbb{F}_q\)-linear codes ⋮ High-rate codes with sublinear-time decoding ⋮ Simultaneous rational function reconstruction with errors: handling multiplicities and poles ⋮ Unnamed Item

Cites Work

• Cyclotomic function fields, Artin-Frobenius automorphisms, and list error correction with optimal rate
• Highly resilient correctors for polynomials
• Decoding of Reed Solomon codes beyond the error-correction bound
• Limits to List Decoding Reed–Solomon Codes
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• High-rate codes with sublinear-time decoding
• Algorithmic Results in List Decoding

This page was built for publication: Optimal Rate List Decoding via Derivative Codes