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: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/173494 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | 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 codes with new parameters are presented. Under some constraints, we show that some of the presented linear codes have few weights. |
|---|