A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions (Q661978): Difference between revisions

The paper studies a binary cyclic code \(C_{1,3,13}\) with three zeros \(\alpha, \alpha^3,\) and \(\alpha^{13}\) of length \(2^m-1\) and the weight divisibility of its dual code. In fact, this belongs to a class of binary triple-error-correcting cyclic codes of length \(2^m -1\) for odd \(m\). The authors use results of [\textit{H. D. L. Hollmann} and \textit{Q. Xiang}, in: Proceedings of the fifth international conference on finite fields and applications \(F_q5\). University of Augsburg, Germany, 1999. Berlin: Springer. 251--275 (2001; Zbl 1015.94548)] to show that \(C_{1,3,13}\) has minimum distance at least 7. Finally they show that for any odd integer \(m \geq 5\) the code \(C_{1,3,13}\) has the same weight distribution as the binary primitive BCH code \(C_{1,3,5}\).