Binary $[n,(n\pm 1)/2]$ cyclic codes with good minimum distances from sequences

Xianhong Xie, Yaxin Zhao, Zhonghua Sun +1

Recently, binary cyclic codes with parameters $[n,(n\pm 1)/2,\ge \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construc…