scientific article; zbMATH DE number 7758332

DOI10.4230/lipics.approx/random.2020.30arXiv2005.02478MaRDI QIDQ6062154

Ben D. Lund, Aditya Potukuchi

Publication date: 31 October 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Reed-Solomon codeslist recoveryrandomly punctured codes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results

Cites Work

• It'll Probably Work Out
• Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
• Limits to List Decoding Reed–Solomon Codes
• Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
• Every list-decodable code for high noise has abundant near-optimal rate puncturings
• Concentration of Measure for the Analysis of Randomized Algorithms
• Algorithmic Results in List Decoding

This page was built for publication: