arXiv (All)
open access
A proof of the generalized packing-covering conjecture
The generalized packing--covering conjecture of Elimelech, Firer and Schwartz asserts that, for every linear code $\mathcal{C}$ and every admissible order $t$, the $t$-th generalized Hamming weight $d_t(\mathcal{C})$ and the $t$-th generalized covering radius $R_t(\mathcal{C})$ satisfy $d_t(\mathcal
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 spectral relation between irreducible cyclic codes and generalized Paley graphs#1076203
- An elementary proof of Marton and Shields' obstruction to finitary coding#612602
- An elementary proof of Marton and Shields' obstruction to finitary coding#611125
- 7 U.S.C. § 191 — “Packer” defined#562377
- On a conjecture of Nikiforov concerning the minimal $p$-energy of connected graphs#793400
Record · ID 1129521
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