.png){kind=icon}
.png){kind=icon}
Return
Binary Linear Codes With Few Weights
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2015.2506576.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Linear codes can be applied in secret sharing, authentication codes, association schemes, and strongly regular graphs. This letter generalizes the construction of linear codes by Ding et al. [9], uses more flexible construction method, and presents linear codes with few weights. These codes contain twoweight linear codes, one-weight linear codes, and three-weight linear codes. These codes contain some optimal codes meeting certain bound on linear codes.
Keywords:
Linear codes
weight distribution
association schemes
authentication codes
secret sharing schemes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W