2015/05/28 by Can Xiang, Xiang, Can · 2 citations
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1505.07726
arXiv admin note: text overlap with arXiv:1503.06511, arXiv:1503.06512 by other authors
openalex publication_date 2015/05/28 · arxiv created 2015/12/22 · arxiv updated 2015/12/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach. The first objective of this paper is to establish relationships among some classes of linear codes obtained with this approach, so that the parameters of some classes of linear codes can be derived from those of other classes with known parameters. In this way, linear codes with new parameters will be derived. The second is to present a class of three-weight binary codes and consider their applications in secret sharing.