This analysis determines the algebraic structure of cyclic codes, emphasizing self-dual and LCD codes.
Let p be a prime number and m be a positive integer. In this paper, we investigate cyclic codes of length n over the local non-Frobenius ring R=GR(p2,m)[u], where u2=0 and pu=0. We first determine the algebraic structure of cyclic codes of arbitrary length n. For the case gcd(n,p)=1, we explicitly describe the generators of cyclic codes over R. Moreover, we establish necessary and sufficient conditions for the existence of self-dual and LCD codes, together with their enumeration. Several illustrative examples and tables are presented, highlighting the mass formula for cyclic self-orthogonal codes, cyclic LCD codes, and families of new cyclic codes that arise from our results.
No takes yet. Share an insight, caveat, or question.
Alabiad et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: