2015/05/23 by Shudi Yang, Yang, Shudi, Zheng-An Yao +1
Computer Science · Mathematics · #11T71 #94B15 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT #msc:11T71 #msc:94B15
paper · pdf · doi:10.48550/arxiv.1505.06326
11 pages
arxiv created 2015/07/18 · arxiv updated 2015/07/21
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we determine the explicit complete weight enumerators of two classes of linear codes over \mathbbFp and they may have applications in cryptography and secret sharing schemes. Moreover, some examples are included to illustrate our results.