A characterization of all semiprimitive irreducible cyclic codes in terms of their lengths
- 15 Downloads
Just by looking at the lengths of irreducible cyclic codes, we present a simple numerical characterization by which we can easily identify those codes that are either one-weight or semiprimitive two-weight irreducible cyclic codes over any finite field. We then particularize our characterization to the class of irreducible cyclic codes of dimension two, and with this, we show that regardless of the finite field any code in this class is always either a one-weight or a semiprimitive two-weight irreducible cyclic code. We also explore the weight distribution of another kind of irreducible cyclic codes and present an infinite family comprising two subfamilies of irreducible cyclic codes that were recently studied.
KeywordsIrreducible cyclic codes Semiprimitive codes Weight distribution
The author want to express his gratitude to the anonymous referees for their valuable suggestions.
- 1.Aubry, Y., Langevin, P.: On the weights of binary irreducible cyclic codes. In: Proceedings of Workshop on Coding and Cryptography, Bergen, Norway. Lecture Notes in Computer Science, vol. 3969, pp. 161–169 (2005)Google Scholar
- 16.Shi, M., Zhang, Z., Solé, P.: Two-weight codes and second order recurrences. https://arxiv.org/pdf/1709.04585.pdf (2017)