Determining the Covering Radius of Generalized Zetterberg Codes in Odd Characteristic

This research paper solves the open problem of determining the covering radius for all generalized Zetterberg codes in odd characteristic, finding it to be at most 3 and often 2, with implications for quasi-perfect codes.