English

Determining the covering radius of all generalized Zetterberg codes in odd characteristic

Information Theory 2024-11-22 v1 math.IT

Abstract

For an integer s1s\ge 1, let Cs(q0)\mathcal{C}_s(q_0) be the generalized Zetterberg code of length q0s+1q_0^s+1 over the finite field \Fq0\F_{q_0} of odd characteristic. Recently, Shi, Helleseth, and \"{O}zbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of Cs(q0)\mathcal{C}_s(q_0) for q0s≢7(mod8)q_0^s \not \equiv 7 \pmod{8}, and left the remaining case as an open problem. In this paper, we develop a general technique involving arithmetic of finite fields and algebraic curves over finite fields to determine the covering radius of all generalized Zetterberg codes for q0s7(mod8)q_0^s \equiv 7 \pmod{8}, which therefore solves this open problem. We also introduce the concept of twisted half generalized Zetterberg codes of length q0s+12\frac{q_0^s+1}{2}, and show the same results hold for them. As a result, we obtain some quasi-perfect codes.

Keywords

Cite

@article{arxiv.2411.14087,
  title  = {Determining the covering radius of all generalized Zetterberg codes in odd characteristic},
  author = {Minjia Shi and Shitao Li and Tor Helleseth and Ferruh Ozbudak},
  journal= {arXiv preprint arXiv:2411.14087},
  year   = {2024}
}