English

Matrix-product structure of constacyclic codes over finite chain rings $\mathbb{F}_{p^m}[u]/\langle u^e\rangle$

Information Theory 2018-03-06 v1 math.IT

Abstract

Let m,em,e be positive integers, pp a prime number, Fpm\mathbb{F}_{p^m} be a finite field of pmp^m elements and R=Fpm[u]/ueR=\mathbb{F}_{p^m}[u]/\langle u^e\rangle which is a finite chain ring. For any ωR×\omega\in R^\times and positive integers k,nk, n satisfying gcd(p,n)=1{\rm gcd}(p,n)=1, we prove that any (1+ωu)(1+\omega u)-constacyclic code of length pknp^kn over RR is monomially equivalent to a matrix-product code of a nested sequence of pkp^k cyclic codes with length nn over RR and a pk×pkp^k\times p^k matrix ApkA_{p^k} over Fp\mathbb{F}_p. Using the matrix-product structures, we give an iterative construction of every (1+ωu)(1+\omega u)-constacyclic code by (1+ωu)(1+\omega u)-constacyclic codes of shorter lengths over RR.

Keywords

Cite

@article{arxiv.1803.01095,
  title  = {Matrix-product structure of constacyclic codes over finite chain rings $\mathbb{F}_{p^m}[u]/\langle u^e\rangle$},
  author = {Yuan Cao and Yonglin Cao and Fang-Wei Fu},
  journal= {arXiv preprint arXiv:1803.01095},
  year   = {2018}
}

Comments

arXiv admin note: text overlap with arXiv:1705.08819