arXiv (All)
open access
Sunflowers of Reed--Solomon Codes
We introduce and study Reed--Solomon sunflowers, namely families of Reed--Solomon codes whose pairwise intersections are all equal to the same fixed subspace. This notion lies at the intersection of extremal subspace combinatorics and coding theory: it can be viewed as a structured version of the su
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Codes in (Generalized) Symmetric Groups#985142
- Equivalence and characterizations of linear rank-metric codes based on invariants#262361
- An Improvement to the Upper Bound for Marton's Covering Conjecture#799548
- An Improvement to the Upper Bound for Marton's Covering Conjecture#798125
- Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance#1117849
Record · ID 1118224
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive