2015/05/21 by Shudi Yang, Yang, Shudi, Zheng‐an Yao +2
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #cs.IT #graph theory and CDMA systems #math.IT #msc:11T71 #msc:94B15
paper · pdf · doi:10.48550/arxiv.1505.05576
18 pages
arxiv created 2016/02/27 · arxiv updated 2016/03/01
Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime p, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding exponential sums. As applications of this general strategy, we determine the complete weight enumerator of several p-ary cyclic codes and give some examples to illustrate our results.