加载中…
In this paper, we investigate cyclic code over the ring ${p^k} + v{p^k} + v^2{p^k} + … + v^r{p^k}v^{r+1}=vpr>1\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.

生成讲解博客的中文版本

生成AI智能校验的中文版本