所属单位：理学院
发表刊物：DESIGNS CODES AND CRYPTOGRAPHY
关键字：Linear codes Weight distribution Gauss sums Secret sharing schemes
摘要：Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of q-ary linear codes under some certain conditions, where q is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.
ISSN号：0925-1022
是否译文：否
发表时间：2017-05-01
合写作者：Heng, Ziling
通讯作者：岳勤
发表时间：2017-05-01