In this paper, the cyclic codes of length n, where n is odd with certain restrictions, over a finite chain ring R, have been studied using the structure of group algebra approach. The primitive idempotents of RG of a finite cyclic group G have been determined, and then the number of codewords and the minimum weight corresponding to a cyclic code have been computed.
Antil et al. (Mon,) studied this question.