English

Constacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$

Information Theory 2017-10-25 v2 math.IT

Abstract

Let Fpm\mathbb{F}_{p^m} be a finite field of cardinality pmp^m and R=Fpm[u]/u2=Fpm+uFpmR=\mathbb{F}_{p^m}[u]/\langle u^2\rangle=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m} (u2=0)(u^2=0), where pp is a prime and mm is a positive integer. For any λFpm×\lambda\in \mathbb{F}_{p^m}^{\times}, an explicit representation for all distinct λ\lambda-constacyclic codes over RR of length psnp^sn is given by a canonical form decomposition for each code, where ss and nn are positive integers satisfying gcd(p,n)=1{\rm gcd}(p,n)=1. For any such code, using its canonical form decomposition the representation for the dual code of the code is provided. Moreover, representations for all distinct negacyclic codes and their dual codes of length psnp^sn over RR are obtained, and self-duality for these codes are determined. Finally, all distinct self-dual negacyclic codes over F5+uF5\mathbb{F}_5+u\mathbb{F}_5 of length 25s3t2\cdot 5^s\cdot 3^t are listed for any positive integer tt.

Keywords

Cite

@article{arxiv.1512.01406,
  title  = {Constacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$},
  author = {Yonglin Cao and Yuan Cao and Jian Gao and Fang-wei Fu},
  journal= {arXiv preprint arXiv:1512.01406},
  year   = {2017}
}