English

Optimal three-weight cyclic codes whose duals are also optimal

Information Theory 2021-07-12 v1 math.IT

Abstract

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized this result by presenting several classes of cyclic codes with either optimal three weights or a few weights. Here we present a new class of optimal three-weight cyclic codes of length q+1q+1 and dimension 3 over any finite field FqF_q, and show that the nonzero weights are q1q-1, qq, and q+1q+1. We then study the dual codes in this new class, and show that they are also optimal cyclic codes of length q+1q+1, dimension q2q-2, and minimum Hamming distance 44. Lastly, as an application of the Krawtchouck polynomials, we obtain the weight distribution of the dual codes.

Keywords

Cite

@article{arxiv.2107.04579,
  title  = {Optimal three-weight cyclic codes whose duals are also optimal},
  author = {Gerardo Vega and Félix Hernández},
  journal= {arXiv preprint arXiv:2107.04579},
  year   = {2021}
}
R2 v1 2026-06-24T04:03:04.015Z