Image de couverture de livre

Generic Reed-Solomon Codes Achieve List-decoding Capacity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brakensiek, Joshua, Gopi, Sivakanth, Makam, Visu
Format:	Preprint
Publié:	2022
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

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
par: Doron, Dean, et autres
Publié: (2024)

AG Codes Achieve List-decoding Capacity over Constant-sized Fields
par: Brakensiek, Joshua, et autres
Publié: (2023)

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
par: Brakensiek, Joshua, et autres
Publié: (2023)

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

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

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

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

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

Improved Field Size Bounds for Higher Order MDS Codes
par: Brakensiek, Joshua, et autres
Publié: (2022)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
par: Brakensiek, Joshua, et autres
Publié: (2025)

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

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

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

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

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

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)

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

Classification of Non-redundancy of Boolean Predicates of Arity 4
par: Brakensiek, Joshua, et autres
Publié: (2026)

Maximal Recoverability: A Nexus of Coding Theory
par: Brakensiek, Joshua, et autres
Publié: (2026)

Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes
par: Brakensiek, Joshua, et autres
Publié: (2024)

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

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

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

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

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
par: Brakensiek, Joshua, et autres
Publié: (2025)

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

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

More MDS codes of non-Reed-Solomon type
par: Wu, Yansheng, 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)

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

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

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

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
par: Brakensiek, Joshua, et autres
Publié: (2025)

Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture
par: Bürgisser, Peter, et autres
Publié: (2024)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
par: Li, Songsong, et autres
Publié: (2025)

Redundancy Is All You Need (for CSP Sparsification)
par: Brakensiek, Joshua, et autres
Publié: (2024)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
par: Brakensiek, Joshua, et autres
Publié: (2025)

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

Multivariate Analytic Combinatorics for Cost Constrained Channels
par: Lenz, Andreas, et autres
Publié: (2021)