The cyclic codes of length $5p^s$ over $\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}$ and their dual codes

Brahim Boudine, Jamal Laaouine, Mohammed Elhassani Charkani


Let $p$ be a prime integer and $m$ be an integer such that $p \equiv 2\pmod 5$ or $p \equiv \pmod 5$ and $m$ is odd. We classify explicitly the cyclic codes of length $5p^s$ over $R= \mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ with $u^2=0$ and we compute completely their dual codes.


cyclic code, cyclotomic polynomial, error-correcting codes

Full Text:


ISSN: 1331-0623 (Print), 1848-8013 (Online)