arXiv (All)
open access
Additive codes arising from hypergraphs
We study the critical exponent of additive codes through an integer polymatroid associated with the code. We give a coding-theoretic proof of Whittle's Critical Theorem in this setting, a geometric description of the critical exponent in terms of $h$-projective systems, and general bounds, including
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 lengths of MDS codes with a two-transitive permutation automorphism group#972228
- Free and projective LCD codes#1109437
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Quantitative tiling stability from quadratic discrepancy in Hamming spaces#1117559
- Codes in the Sum-Rank Metric and Codes over Rings / Cornelia Ott#1052404
Record · ID 1144647
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