The following pages link to Explicit subspace designs (Q2400105):
Displaying 20 items.
- Higgledy-piggledy subspaces and uniform subspace designs (Q281328) (← links)
- Lines in higgledy-piggledy arrangement (Q405273) (← links)
- Large sets of subspace designs (Q501693) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Almost affinely disjoint subspaces (Q1979948) (← links)
- An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- Subspace designs based on algebraic function fields (Q4691091) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- (Q5121892) (← links)
- (Q5875528) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
- (Q6084352) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces (Q6570056) (← links)
- Variety evasive subspace families (Q6599767) (← links)