2021/12/11 by Canze Zhu, Zhu, Canze, Qunying Liao +1
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2112.06027
openalex publication_date 2021/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, for any odd prime p and an integer m≥ 3, several classes of linear codes with t-weight (t=3,5,7) are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by employing Gauss sums and quadratic character sums. Especially for m = 3, a class of MDS codes with parameters [p,3,p-2] are obtained. Furthermore, some of these codes can be suitable for applications in secret sharing schemes and s-sum sets for any odd s>1.