Weight enumerator of some irreducible cyclic codes
F.E. Brochero Mart\'inez, C. R. Giraldo Vergara

TL;DR
This paper explicitly determines the weight enumerators for all irreducible cyclic codes of certain lengths over finite fields, under specific divisibility conditions, providing comprehensive formulas for these codes.
Contribution
It provides explicit formulas for the weight enumerators of irreducible cyclic codes when prime divisors of length divide q-1, covering all such cases.
Findings
Explicit weight enumerators for all relevant irreducible cyclic codes.
Complete classification under the divisibility condition.
Facilitates analysis of code properties and error correction capabilities.
Abstract
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length over a finite field , in the case which each prime divisor of is also a divisor of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Quantum-Dot Cellular Automata
