Image de couverture de livre

Random Reed-Solomon Codes are List Recoverable with Optimal List Size

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Doron, Dean, Venkitesh, S.
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Computational Complexity Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Generic Reed-Solomon Codes Achieve List-decoding Capacity
par: Brakensiek, Joshua, et autres
Publié: (2022)

Improved List Size for Folded Reed-Solomon Codes
par: Srivastava, Shashank
Publié: (2024)

LDPC Codes Achieve List Decoding Capacity
par: Mosheiff, Jonathan, et autres
Publié: (2019)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
par: Jeronimo, Fernando Granha, et autres
Publié: (2026)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Punctured Low-Bias Codes Behave Like Random Linear Codes
par: Guruswami, Venkatesan, et autres
Publié: (2021)

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
par: Resch, Nicolas, et autres
Publié: (2025)

Deterministic list decoding of Reed-Solomon codes
par: Chatterjee, Soham, et autres
Publié: (2025)

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
par: Ron-Zewi, Noga, et autres
Publié: (2024)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
par: Doron, Dean, et autres
Publié: (2024)

Advances in List Decoding of Polynomial Codes
par: Kumar, Mrinal, et autres
Publié: (2026)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
par: Goyal, Rohan, et autres
Publié: (2025)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
par: Goyal, Rohan, et autres
Publié: (2023)

Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
par: First, Uriya A., et autres
Publié: (2024)

An exposition of recent list-size bounds of FRS Codes
par: Garg, Abhibhav, et autres
Publié: (2025)

Polynomials, Divided Differences, and Codes
par: Venkitesh, S.
Publié: (2024)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
par: Alrabiah, Omar, et autres
Publié: (2024)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
par: Goyal, Rohan, et autres
Publié: (2025)

Nearly-Linear Time Seeded Extractors with Short Seeds
par: Doron, Dean, et autres
Publié: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
par: Con, Roni, et autres
Publié: (2024)

When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
par: Cheng, Kuan, et autres
Publié: (2026)

List Decoding of Reed-Solomon Codes and Folded Reed-Solomon Codes Over Galois Ring
par: Yuan, Chen, et autres
Publié: (2025)

Near-Optimal List-Recovery of Linear Code Families
par: Li, Ray, et autres
Publié: (2025)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
par: Goldenberg, Elazar, et autres
Publié: (2024)

On the number of inequivalent linearized Reed-Solomon codes
par: Mannaert, Jonathan, et autres
Publié: (2026)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
par: Chen, Yeyuan, et autres
Publié: (2024)

Successive Cancellation List Decoding of Extended Reed-Solomon Codes
par: Ye, Xiaoqian, et autres
Publié: (2026)

More MDS codes of non-Reed-Solomon type
par: Wu, Yansheng, et autres
Publié: (2024)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
par: Srivastava, Shashank, et autres
Publié: (2025)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
par: Guo, Zeyu, et autres
Publié: (2024)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
par: Grüne, Christoph
Publié: (2022)

Explicit List-Decodable Linearized Reed-Solomon and Folded Linearized Reed-Solomon Subcodes
par: Shang, Kuo, et autres
Publié: (2026)

List-Recovery of Random Linear Codes over Small Fields
par: Doron, Dean, et autres
Publié: (2025)

Secret Sharing on Superconcentrator
par: Li, Yuan
Publié: (2023)

List Decoding Quotient Reed-Muller Codes
par: Gotlib, Omri, et autres
Publié: (2025)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
par: Ashvinkumar, Vikrant, et autres
Publié: (2025)

The Optimization of Random Tree Codes for Limited Computational Resources
par: Bacinoglu, B. Tan
Publié: (2025)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
par: Chen, Kean, et autres
Publié: (2025)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
par: Berman, Amit, et autres
Publié: (2024)