scientific article; zbMATH DE number 7758311

DOI10.4230/lipics.approx/random.2020.9MaRDI QIDQ6084352

Venkatesan Guruswami, Nicolas Resch, Jonathan Mosheiff, Shashwat Silas, Mary Wootters, Ray Li

Publication date: 31 October 2023

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

zbMATH Keywords

coding theorylist-decodingrandom linear codeslist-recovery

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the sharp concentration of the chromatic number of random graphs
• Linear-time list recovery of high-rate expander codes
• Explicit subspace designs
• Combinatorial Limitations of Average-Radius List-Decoding
• It'll Probably Work Out
• Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications
• Parallel Hashing via List Recoverability
• Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
• Linear time encodable and list decodable codes
• Limits to list decoding Reed-Solomon codes
• Combinatorial bounds for list decoding
• The Diameter of Sparse Random Graphs
• Local List Recovery of High-Rate Tensor Codes and Applications
• On List Recovery of High-Rate Tensor Codes
• Every list-decodable code for high noise has abundant near-optimal rate puncturings
• Folded codes from function field towers and improved optimal rate list decoding
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
• On the list decodability of random linear codes with large error rates

This page was built for publication: