2015/07/21 by Shudi Yang, Yang, Shudi, Zhang-An Yao +3
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.1507.05732
13 pages
arxiv created 2015/07/21 · arxiv updated 2015/07/22
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime p, we determine the explicit complete weight enumerators of a family of linear codes over \mathbbFp with defining set related to cyclotomy. These codes may have applications in cryptography and secret sharing schemes.