Some Repeated-Root Constacyclic Codes Over Galois Rings

DOI10.1109/TIT.2017.2738627MaRDI QIDQ4566487zbMATH OpenOpenAlexFDO

Authors Youcef Maouche, Hongwei Liu

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.00247

Mathematics Subject Classification ID

Cyclic codes (94B15)

Abstract: Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $mathcal{R}_2(a,m,-1)=fracGR(2^a,m)[x]langle{x}^{2^s}+1angle$ is a chain ring. Furthermore, these results have been generalized to $lambda$-constacyclic codes for any unit $lambda$ of the form $4z-1$, $zinGR(2^a,m)$. In this paper, we study more general cases and investigate all cases where $mathcal{R}_p(a,m,gamma)=fracGR(p^a,m)[x]langle{x}^{p^s}-gammaangle$ is a chain ring. In particular, necessary and sufficient conditions for the ring $mathcal{R}_p(a,m,gamma)$ to be a chain ring are obtained. In addition, by using this structure we investigate all $gamma$-constacyclic codes over $GR(p^a,m)$ when $mathcal{R}_p(a,m,gamma)$ is a chain ring. Necessary and sufficient conditions for the existence of self-orthogonal and self-dual $gamma$-constacyclic codes are also provided. Among others, for any prime $p$, the structure of $mathcal{R}_p(a,m,gamma)=fracGR(p^a,m)[x]langle{x}^{p^s}-gammaangle$ is used to establish the Hamming and homogeneous distances of $gamma$-constacyclic codes.

Cited in

(14)

• Non-invertible-element constacyclic codes over finite PIRs
• On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length
• Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
• On \(\sigma \)-self-orthogonal constacyclic codes over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
• Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
• Repeated-root cyclic and negacyclic codes over a finite chain ring
• On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
• Consta-Abelian Codes Over Galois Rings
• Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
• On Repeated-Single-Root Constacyclic Codes
• Repeated-root constacyclic codes of length $2p^s$ over Galois rings
• Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)
• An explicit expression for all distinct self-dual cyclic codes of length \(p^k\) over Galois ring \(\mathrm{GR}(p^2,m)\)
• A characterization of optimal constacyclic locally repairable codes

This page was built for publication: Some Repeated-Root Constacyclic Codes Over Galois Rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566487)