Three new constructions of optimal linear codes with few weights
Linear codes play a key role in widespread applications. In this paper, we propose three new constructions of linear codes. We give some sufficient conditions for the constructed linear codes to be optimal or distance-optimal in terms of the Griesmer bound. Three classes of distance-optimal linear c...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2024
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/173494 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |