arXiv (All)
open access
Puncturing-inclusion constructions of optimal Ferrers diagram rank-metric codes using semifield codes
Ferrers diagram rank-metric codes are essential components of the multilevel construction of constant dimension codes for random network coding. This paper aims to construct optimal Ferrers diagram rank-metric codes, focusing on the diagram \([3,3,3,5]\) with rank distance \(3\). We construct an opt
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
- Decoding rank metric Reed-Muller codes#153696
- Bayesian Efficient Coding#10030
- Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments#785214
- Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments#783623
- Improved Johnson-type Bounds for Insertion-Deletion Codes#615029
Record · ID 1342784
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