A class of binary cyclic codes with optimal parameters

Kaiqiang Liu, Qi Wang, Haode Yan

Abstract

For positive integers k ≥ 2 and t, let m = 2kt and α be a primitive element of the finite field F 2 m $\mathbb {F}_{2^{m}}$ . In this paper, we study the parameters of a class of cyclic codes C ( 1 , v ) $\mathcal {C}_{(1,v)}$ which has two zeros α and αv with v = 2 m − 1 2 t + 1 $v=\frac {2^{m}-1}{2^{t}+1}$ . It is shown that C ( 1 , v ) $\mathcal {C}_{(1,v)}$ is optimal or almost optimal with respect to the sphere packing bound. Based on some results of Kloosterman sums and Gaussian periods, the weight distribution of the dual code of C ( 1 , v ) $\mathcal {C}_{(1,v)}$ is completely determined when t = 5.
BibTeX
@article{liu2022class,
  author = {Kaiqiang Liu and Qi Wang and Haode Yan},
  title = {{A class of binary cyclic codes with optimal parameters}},
  journal = {Cryptogr. Commun.},
  year = {2022},
  doi = {10.1007/s12095-021-00548-1},
}

Loading related content...

Figure