The complete weight enumerator of a subclass of optimal three-weight cyclic codes
Gerardo Vega, F\'elix Hern\'andez

TL;DR
This paper extends the understanding of optimal cyclic codes by describing a broader class of five-weight codes and deriving the complete weight enumerator for a subclass of three-weight codes, with implications for code optimality.
Contribution
It generalizes existing results on optimal cyclic codes, providing a broader class of five-weight codes and explicitly calculating the weight enumerator for a subclass of three-weight codes.
Findings
Enlarged class of optimal five-weight cyclic codes over any finite field.
Complete weight enumerator derived for a subclass of three-weight cyclic codes.
Dual codes have parameters that are among the best known for linear codes.
Abstract
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized this result by presenting several classes of cyclic codes with either optimal three weights or a few weights. On the other hand, a class of optimal five-weight cyclic codes of dimension 4 over a prime field was recently presented by Li, et al. [Adv. Math. Commun., 13(1) (2019) 137-156]. One of the purposes of this work is to present a more general description for these optimal five-weight cyclic codes, which gives place to an enlarged class of optimal five-weight cyclic codes of dimension 4 over any finite field. As an application of this enlarged class, we present the complete weight enumerator of a subclass of the optimal three-weight cyclic codes…
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 · Cooperative Communication and Network Coding · graph theory and CDMA systems
