arXiv (All)
open access
Annihilator and twisted Euclidean duality for quasi-polycyclic codes
Let $f\in\mathbb F_q[x]$ be a monic polynomial of degree $m$ with $f(0)\ne 0$, and let $\mathcal R=\mathbb F_q[x]/\langle f\rangle$. Under coefficient expansion, a quasi-polycyclic (QP) code of index $n$ corresponds to an $\mathcal R$-submodule of $\mathcal R^n$. In this paper, we study QP codes wit
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
- Hyper-derivative Algebraic Geometry Codes via Local Expansions#1011797
- On the construction of universal families of hash functions via geometric codes and concatenation#612900
- Bivariate Bicycle Codes over Group Algebras#1131055
- Confluence relations for $q$-analogues of multiple zeta values#821497
- Dual-Module QR Codes: Bypassing QR Code Scanners in Enterprise Email GatewaysWhitepaperOffensive Operations6 Aug 2026Steven Legere#434819
Record · ID 1062520
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