A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions

From MaRDI portal
Publication:661978

DOI10.1016/J.FFA.2011.06.005zbMATH Open1246.94053arXiv1003.5993OpenAlexW2963011145MaRDI QIDQ661978FDOQ661978

Jinyong Shan, Xiangyong Zeng, Lei Hu

Publication date: 11 February 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Based on a sufficient condition proposed by Hollmann and Xiang for constructing triple-error-correcting codes, the minimum distance of a binary cyclic code mathcalC1,3,13 with three zeros alpha, alpha3, and alpha13 of length 2m1 and the weight divisibility of its dual code are studied, where mgeq5 is odd and alpha is a primitive element of the finite field mathbbF2m. The code mathcalC1,3,13 is proven to have the same weight distribution as the binary triple-error-correcting primitive BCH code mathcalC1,3,5 of the same length.


Full work available at URL: https://arxiv.org/abs/1003.5993





Cites Work


Cited In (37)






This page was built for publication: A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q661978)