The weight distributions of some linear codes derived from Kloosterman sums
Information Theory
2024-07-16 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2407.10051,
title = {The weight distributions of some linear codes derived from Kloosterman sums},
author = {Mengzhen Zhao and Yanxun Chang},
journal= {arXiv preprint arXiv:2407.10051},
year = {2024}
}
Comments
11 pages