arXiv (OAI Expanded)
open access
Periodicity of weight enumerators for codes generated by an integral matrix
In the theory of error-correcting codes, the minimum weight and the weight enumerator play a crucial role in evaluating the error-correcting performance. In this paper, by viewing the weight enumerator as a quasi-polynomial, we reduce the determination of the minimum weight of the resulting family t
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
- Cryptography based on error correcting codes#460193
- Cyclicity of Binary Group Codes.#1173
- Lower Bounds for all List-Decodable Deletion Codes#1062537
- Stall Pattern Avoidance in Polynomial Product Codes#1061540
- Universal Hashing and Geometric Codes#921554
Record · ID 1069734
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