The weight distributions of some linear codes derived from Kloosterman sums
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917721582600192 |
|---|---|
| author | Zhao, Mengzhen Chang, Yanxun |
| author_facet | Zhao, Mengzhen Chang, Yanxun |
| contents | Linear codes with few weights have applications in data storage systems, secret
sharing schemes, and authentication codes. In this paper, some kinds of p-ary linear codes
with few weights are constructed by use of the given de ning set, where p is a prime.
Their weight distributions are determined based on Kloosterman sums over nite elds. In
addition, some linear codes we given is minimal. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_10051 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The weight distributions of some linear codes derived from Kloosterman sums Zhao, Mengzhen Chang, Yanxun Information Theory 94A24, 94B05 Linear codes with few weights have applications in data storage systems, secret sharing schemes, and authentication codes. In this paper, some kinds of p-ary linear codes with few weights are constructed by use of the given de ning set, where p is a prime. Their weight distributions are determined based on Kloosterman sums over nite elds. In addition, some linear codes we given is minimal. |
| title | The weight distributions of some linear codes derived from Kloosterman sums |
| topic | Information Theory 94A24, 94B05 |
| url | https://arxiv.org/abs/2407.10051 |