Complete weight enumerators of two classes of linear codes
Qiuyan Wang, Fei Li, Kelan Ding, Dongdai Lin
TL;DR
This paper determines the complete weight enumerators of two classes of p-ary linear codes, revealing they are nearly seven-weight codes with potential applications in secret sharing schemes.
Contribution
It provides explicit formulas for the complete weight enumerators of two new classes of linear codes constructed from defining sets.
Findings
Codes are almost seven-weight linear codes
Potential applications in secret sharing schemes
Explicit weight enumerator formulas derived
Abstract
Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications in secret sharing schemes.
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