Papers
Topics
Authors
Recent
Search
2000 character limit reached

A class of repeated-root constacyclic codes over Fpm[u]/⟨ue⟩\mathbb{F}_{p^m}[u]/\langle u^e\rangle of Type $2$

Published 15 May 2018 in cs.IT and math.IT | (1805.05595v2)

Abstract: Let F<em>p<sup>m\mathbb{F}<em>{p<sup>m} be a finite field of cardinality p<sup>mp<sup>m where pp is an odd prime, nn be a positive integer satisfying gcd(n,p)=1{\rm gcd}(n,p)=1, and denote R=F</em>p<sup>m[u]/⟨</sup>u<sup>e⟩R=\mathbb{F}</em>{p<sup>m}[u]/\langle</sup> u<sup>e\rangle where e≥4e\geq 4 be an even integer. Let δ,α∈F<em>p<sup>m<sup>×\delta,\alpha\in \mathbb{F}<em>{p<sup>m}<sup>{\times}. Then the class of (δ+αu<sup>2)(\delta+\alpha u<sup>2)-constacyclic codes over RR is a significant subclass of constacyclic codes over RR of Type 2. For any integer k≥1k\geq 1, an explicit representation and a complete description for all distinct (δ+αu<sup>2)(\delta+\alpha u<sup>2)-constacyclic codes over RR of length np<sup>knp<sup>k and their dual codes are given. Moreover, formulas for the number of codewords in each code and the number of all such codes are provided respectively. In particular, all distinct (δ+αu<sup>2)(\delta+\alpha u<sup>2)-contacyclic codes over F</em>p<sup>m[u]/⟨</sup>u<sup>e⟩\mathbb{F}</em>{p<sup>m}[u]/\langle</sup> u<sup>{e}\rangle of length p<sup>kp<sup>k and their dual codes are presented precisely.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.