所属单位：理学院
发表刊物：FINITE FIELDS AND THEIR APPLICATIONS
关键字：Linear codes Secret sharing schemes Strongly regular graphs Gauss sums
摘要：Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of q-ary linear codes from trace and norm functions over finite fields. The weight distributions of the linear codes are determined in some cases based on Gauss sums. It is interesting that our construction can produce optimal or almost optimal codes. Furthermore, we show that our codes can be used to construct secret sharing schemes with interesting access structures and strongly regular graphs with new parameters. (C) 2017 Elsevier Inc. All rights reserved.
ISSN号：1071-5797
是否译文：否
发表时间：2017-11-01
合写作者：Heng, Ziling
通讯作者：Heng, Ziling,岳勤
发表时间：2017-11-01