Analysis finds the number of codewords and minimum weight in cyclic codes over finite chain rings, indicating new insights into their structure.
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.
No takes yet. Share an insight, caveat, or question.
Antil et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: