{"paper":{"title":"$(1-2u^2)$-constacyclic codes over $\\mathbb{F}_p+u\\mathbb{F}_p+u^2\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hojjat Mostafanasab, Negin Karimi","submitted_at":"2015-06-24T08:00:27Z","abstract_excerpt":"Let $\\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\\mathbb{F}_p+u\\mathbb{F}_p+u^2\\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07273","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}