Image de couverture de livre

Explicit Codes approaching Generalized Singleton Bound using Expanders

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jeronimo, Fernando Granha, Mittal, Tushant, Srivastava, Shashank, Tulsiani, Madhur
Format:	Preprint
Publié:	2025
Sujets:	Information Theory Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

List Decodable Quantum LDPC Codes
par: Bergamaschi, Thiago, et autres
Publié: (2024)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

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

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

Derandomized Non-Abelian Homomorphism Testing in Low Soundness Regime
par: Mittal, Tushant, et autres
Publié: (2024)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
par: Tulsiani, Madhur, et autres
Publié: (2024)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
par: Cohen, Gil, et autres
Publié: (2025)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
par: Jeronimo, Fernando Granha, et autres
Publié: (2022)

Explicit Constant-Alphabet Subspace Design Codes
par: Goyal, Rohan, et autres
Publié: (2026)

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

A General Framework for Low Soundness Homomorphism Testing
par: Mittal, Tushant, et autres
Publié: (2025)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
par: Block, Alexander R., et autres
Publié: (2026)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
par: Blocki, Jeremiah, et autres
Publié: (2021)

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

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
par: Moradi, Mohsen, et autres
Publié: (2024)

The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
par: Jeronimo, Fernando Granha, et autres
Publié: (2024)

The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
par: Gay, William, et autres
Publié: (2026)

Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs
par: Singer, Noah G., et autres
Publié: (2026)

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
par: Janzer, Oliver, et autres
Publié: (2024)

Explicit optimal-length locally repairable codes of distance 5
par: Beemer, Allison, et autres
Publié: (2018)

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

Explicit Lossless Vertex Expanders
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

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

Oblivious Deletion Codes
par: Con, Roni, et autres
Publié: (2025)

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

Decoding Balanced Linear Codes With Preprocessing
par: Bogdanov, Andrej, et autres
Publié: (2025)

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

High Rate Multivariate Polynomial Evaluation Codes
par: Kopparty, Swastik, et autres
Publié: (2024)

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

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
par: Fawzi, Omar, et autres
Publié: (2023)

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

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
par: Drucker, Andrew, et autres
Publié: (2024)

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

Pseudorandom and Pseudoentangled States from Subset States
par: Jeronimo, Fernando Granha, 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)

Sketching approximations and LP approximations for finite CSPs are related
par: Singer, Noah G., et autres
Publié: (2025)

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