Some three-weight linear codes and their complete weight enumerators and weight hierarchies
Xiumei Li, Zongxi Chen, Fei Li

TL;DR
This paper constructs a new class of three-weight linear codes over finite fields using quadratic functions, and fully determines their weight enumerators and hierarchies, extending previous research in the area.
Contribution
It introduces a bivariate construction method for three-weight codes and provides complete weight enumerators and hierarchies, generalizing earlier results.
Findings
Constructed new three-weight linear codes from quadratic functions.
Determined complete weight enumerators of the codes.
Established the weight hierarchies of the codes.
Abstract
Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power , we construct a class of three-weight -linear codes from quadratic functions via a bivariate construction and then determine the complete weight enumerators and weight hierarchies of these linear codes completely. This paper generalizes some results in Li et al. (2022) and Hu et al. (2024).
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 · Advanced Wireless Communication Techniques
