Explicit Subspace Evasive Sets via Subspace Designs
cs.DM, cs.IT, math.CO, math.IT
Submitted: 2026-11-11
Updated: 2026-11-11
Code: https://github.com/yeyuanch/List-recoverable-subcodes-of-AG-codes
Terminology
Sources
- An Improved Construction of Variety-Evasive Subspace Families
- Bounds and Limitations on Codes Achieving List Recovery Capacity
- Separating Quantum and Classical Advice with Good Codes
- Algebraic-Geometric Parvaresh--Vardy Subspace Designs and Rank Condensers
- Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
- Large line-free sets and their applications
- Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
- Explicit Constant-Alphabet Subspace Design Codes
- Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
- Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy
- Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
- Large $(k; r, s; n, q)$-sets in Projective Spaces
- Explicit Codes approaching Generalized Singleton Bound using Expanders
- Advances in List Decoding of Polynomial Codes
- Incidence bounds via extremal graph theory
- Improved List Size for Folded Reed-Solomon Codes
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns