Determining the covering radius of all generalized Zetterberg codes in odd characteristic
Preprint
Abstract
For an integer $s\ge 1$, let $\mathcal{C}_s(q_0)$ be the generalized Zetterberg code of length $q_0^s+1$ over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Helleseth, and Özbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of $\mathcal{C}_s(q_0)$ for $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 $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 $\frac{q_0^s+1}{2}$, and show the same results hold for them. As a result, we obtain some quasi-perfect codes.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Quasi-perfect linear codes from planar and APN functionsCryptography and Communications, 2015
- A family of constacyclic ternary quasi-perfect codes with covering radius 3Designs, Codes and Cryptography, 2010
- A family of ternary quasi-perfect BCH codesDesigns, Codes and Cryptography, 2008
- The packing problem in statistics, coding theory and finite projective spacesJournal of Statistical Planning and Inference, 1998
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Covering Radius of the Reed–Muller CodeR(1, 7)—A Simpler ProofJournal of Combinatorial Theory, Series A, 1996
- On the covering radius of long binary BCH codesDiscrete Applied Mathematics, 1987
- A new approach to the covering radius of codesJournal of Combinatorial Theory, Series A, 1986
- On the covering radius of cyclic linear codes and arithmetic codesDiscrete Applied Mathematics, 1985
- Two-error correcting Bose-Chaudhuri codes are quasi-perfectInformation and Control, 1960