arXiv (All)
open access
The Support-Distribution Conditions for MSRD Codes Reduce to a Single Inequality
Byrne, Gluesing-Luerssen, and Ravagnani determined the number of codewords with a prescribed nonzero support in a linear maximum sum-rank distance code whose blocks have a common number of columns. Their formula depends only on the code parameters and the support dimensions. Evaluating it for arbitr
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 the Length of Maximum Sum-Rank Distance Codes#1388007
- Efficient construction of subspace design codes over constant alphabet#1354380
- 1 U.S.C. § 202 — Preparation and publication of Codes and Supplements#557429
- Bounds on Codes Correcting Adjacent Transpositions#609817
- Linear programming bounds for binary and ternary LCD Codes#1109155
Record · ID 1491050
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