arXiv (All)
open access
Near-uniform $q$-matroids
We study the $q$-matroids associated with nondegenerate $\F_{q^m}$-linear near-MRD codes, which we call near-uniform $q$-matroids. Using the correspondence between rank-metric codes and their associated $q$-systems, we determine explicitly their rank functions and characterize their cyclic flats. We
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
- The Optimal Asymptotic Rate of Generalized Covering Codes#793913
- The Optimal Asymptotic Rate of Generalized Covering Codes#789894
- New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21#925224
- New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21#920988
- Data Protection in Function-Correcting Symbol-Pair Codes: Redundancy Bounds and Protection Profiles#998559
Record · ID 1142138
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