A description of the class of composite length cyclic codes

Abstract

In this study, a novel subclass of cyclic codes with composite length is constructed. In order to efficiently encode and decode data, we offer the generator matrix for the built cyclic codes. This research focuses on creating a new kind of cyclic code with lengths that are not prime, by developing a generator matrix for efficient coding and then analyzing its weight distribution to better understand its error correction capabilities. We also demonstrate a few findings about their weight distribution. Our results advance the theory of cyclic codes and may find use in a number of domains, including cryptography, error-correcting codes, and communication systems.