arXiv (All)
open access
Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes
Deriving upper bounds on code size from existing bounds is a classical approach in coding theory, dating back to the seminal results of Elias, Bassalygo, and Levenshtein. We study a framework encompassing the Bassalygo--Elias and Levenshtein inequalities for binary and nonbinary (constant-weight) co
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
- Embedding linear codes over Z4 into self-orthogonal codes#925178
- Embedding linear codes over Z4 into self-orthogonal codes#920943
- Linear programming bounds for binary and ternary LCD Codes#1109155
- New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21#925224
- New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21#920988
Record · ID 1050060
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