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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/173494 |