{"paper":{"title":"One Cyclic Codes over $\\mathbb{F}_{p^k} + v\\mathbb{F}_{p^k} + v^2\\mathbb{F}_{p^k} + ... + v^r\\mathbb{F}_{p^k}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ousmane Ndiaye","submitted_at":"2015-11-05T23:46:02Z","abstract_excerpt":"In this paper, we investigate cyclic code over the ring $\\mathbb{F}_{p^k} + v\\mathbb{F}_{p^k} + v^2\\mathbb{F}_{p^k} + ... + v^r\\mathbb{F}_{p^k}$, where $v^{r+1}=v$, $p$ a prime number, $r>1$ and $\\gcd(r,p)=1$, we prove as generalisation of P. Sol\\'e et al. in 2015 that these codes are principally generated, give generator polynomial and idempotent depending on idempotents over this ring as response to an open problem related by J. QIAN et al. in 2005. we also give a gray map and proprieties of the related dual code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01955","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"}