Binary linear codes with at most 4 weights
Fei Li, Yang Yan, Qiuyan Wang, Tongjiang Yan

TL;DR
This paper constructs a new class of binary linear codes with at most four weights, analyzes their weight distribution, and explores their application in secret sharing schemes.
Contribution
It introduces a novel class of binary linear codes with limited weights and determines their weight distribution, expanding their potential applications.
Findings
Codes are at most 4-weight linear codes
Weight distribution is explicitly determined
Codes are applicable in secret sharing schemes
Abstract
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used 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 · Error Correcting Code Techniques
