Determining the covering radius of all generalized Zetterberg codes in odd characteristic
Abstract
For an integer s 1, let Cs(q0) be the generalized Zetterberg code of length q0s+1 over the finite field q0 of odd characteristic. Recently, Shi, Helleseth, and \"Ozbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of Cs(q0) for q0s 7 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 q0s 7 8, which therefore solves this open problem. We also introduce the concept of twisted half generalized Zetterberg codes of length q0s+12, and show the same results hold for them. As a result, we obtain some quasi-perfect codes.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.