The weight distributions of some linear codes derived from Kloosterman sums
<|reference_start|>The weight distributions of some linear codes derived from Kloosterman sums: 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.<|reference_end|>
@article{zhao2024the,
    title={The weight distributions of some linear codes derived from Kloosterman
  sums},
    author={Mengzhen Zhao, Yanxun Chang},
    journal={arXiv preprint arXiv:2407.10051},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.10051},
    primaryClass={cs.IT math.IT}
}