Determining the covering radius of all generalized Zetterberg codes in odd characteristic
Information Theory
2024-11-22 v1 math.IT
Abstract
For an integer , let be the generalized Zetterberg code of length over the finite field of odd characteristic. Recently, Shi, Helleseth, and \"{O}zbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of for , 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 , which therefore solves this open problem. We also introduce the concept of twisted half generalized Zetterberg codes of length , 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}
}