arXiv (All)
open access
$r$-Minimal Poset Codes
In this paper, we propose and study $r$-minimal codes with respect to $\mathbf{P}$-support, where $\mathbf{P}=(Ω,\preccurlyeq_{\mathbf{P}})$ is a poset defined on the coordinate set of the ambient space $\mathbf{H}$. $r$-Minimal $\mathbf{P}$-codes are natural extensions of Hamming metric minimal cod
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
- An Elementary Proof of the First LP Bound on the Rate of Binary Codes / Nati Linial, Elyassaf Loyfer#1188578
- Degree Power Sums in Extremal Set Systems#1118672
- Minimalism#1224213
- Tight Approximation Results for Matroid Optimization with a Linear Constraint#1076364
- Relaxing full-codebook security: A refined analysis of key-length extension schemes#334375
Record · ID 1216364
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