Weight distributions of two classes of linear codes with few weights derived from Weil sums
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917551591653376 |
|---|---|
| author | Bose, Mrinal Kanti Singh, Abhay Kumar |
| author_facet | Bose, Mrinal Kanti Singh, Abhay Kumar |
| contents | Linear codes with few weights have been a subject of study for many years, as they have applications in secret sharing, authentication codes, association schemes, and strongly regular graphs. In this article, two distinct classes of $p$-ary linear codes are constructed through the selection of two specific defining sets. Their weight distributions are completely determined for each case by detailed calculations on certain Weil sums. The constructed codes are shown to have only two, four, six, eight, and nine nonzero weights under different cases. In particular, we obtained an infinite family of two-weight optimal linear codes with respect to the Griesmer bound. Moreover, we observe that some of our newly constructed codes are minimal under certain conditions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_25578 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Weight distributions of two classes of linear codes with few weights derived from Weil sums Bose, Mrinal Kanti Singh, Abhay Kumar Information Theory 94B05, 11T71, 11T23 Linear codes with few weights have been a subject of study for many years, as they have applications in secret sharing, authentication codes, association schemes, and strongly regular graphs. In this article, two distinct classes of $p$-ary linear codes are constructed through the selection of two specific defining sets. Their weight distributions are completely determined for each case by detailed calculations on certain Weil sums. The constructed codes are shown to have only two, four, six, eight, and nine nonzero weights under different cases. In particular, we obtained an infinite family of two-weight optimal linear codes with respect to the Griesmer bound. Moreover, we observe that some of our newly constructed codes are minimal under certain conditions. |
| title | Weight distributions of two classes of linear codes with few weights derived from Weil sums |
| topic | Information Theory 94B05, 11T71, 11T23 |
| url | https://arxiv.org/abs/2510.25578 |