2020/12/09 by Xina Zhang, Zhang, Xina
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Computer and information sciences #Finite Group Theory Research #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2012.04904
openalex publication_date 2020/12/09 · openalex created_date 2020/12/21 · openalex updated_date 2026/07/28
In this paper, based on the theory of defining sets, a class of four-weight or five-weight linear codes over Fp is constructed. The complete weight enumerators of the linear codes are determined by means of Weil sums. In some case, there is an almost optimal code with respect to Griesmer bound, which is also an optimal one according to the online code table. This is an extension of the results raised by Zhang et al.(2020).