Cyclic codes of length \(2p^n\) over finite chain rings (Q2176290)

For a finite commutative ring \(R\) with unity we say that \(C\) is a linear code of length \(n\) over \(R\) if it is a submodule \(R^n.\) It is known that cyclic codes of length \(n\) over a ring \(R\) can be identified with the ideals of the group ring \(RA\), where \(A\) is the cyclic group of order \(n.\) For a field \(K\) with \(q\) elements and \(A\) a cyclic group of order \(2p^n\), such that \(o(q) =\varphi(p^n)\) in \(U(\mathbb{Z}_{2p^n})\) and \(B=\{1, d\}\) its 2-Sylow subgroup and maximal ideal \(M = \langle a\rangle. \) Extending previous results, the authors compute the minimum Hamming weights and dimensions of an extensive family of cyclic codes \(C=RA\left(a^k\left(\frac{1\pm d}{2}\right)e_i\right),\) with \(0\leq k < t\) of length \(2p^n\) where \(e_i,\) \(0\leq i\leq s,\) denote the primitive idempotents. The authors are using the Hamming weight while others weights are possible for codes over rings, such as the homogeneous weight. Under some restrictive hypothesis, the family of codes considered is the family of all minimal codes.