2015/05/25 by Can Xiang, Hao Liu, Xiang, Can +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Error Correcting Code Techniques #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.06502
This paper has been withdrawn by the author due to some results of us are similiar to others
openalex publication_date 2015/05/25 · arxiv created 2015/05/26 · arxiv updated 2015/05/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to obtain an authentication code with good parameters, the underlying linear code must have proper parameters. The first objective of this paper is to determine the complete weight enumerators of a class of linear codes with two weights and three weights. The second is to employ these linear codes to construct authentication codes with new parameters.