On the Generalized Packing and Covering Radii of Codes

@misc{yu2026generalized,
  title = {{On the Generalized Packing and Covering Radii of Codes}},
  author = {Wenjun Yu and Moshe Schwartz},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.14477},
  eprint = {2609.14477},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.14477},
}

TY  - UNPB
TI  - On the Generalized Packing and Covering Radii of Codes
AU  - Wenjun Yu
AU  - Moshe Schwartz
PY  - 2026
DA  - 2026/09/13
PB  - arXiv
DO  - 10.48550/arxiv.2609.14477
UR  - https://arxiv.org/abs/2609.14477
AB  - The minimum distance and the covering radius are two fundamental properties of the code. Both have been extended: the former to the generalized Hamming weights hierarchy, and the latter to the generalized covering radii hierarchy. In both cases, the lowest level of the hierarchies corresponds to the classical minimum distance and covering radius, respectively. From a geometric point of view, the minimum distance of the code determines the packing radius, which is upper bounded by the covering radius. It was conjectured this relation extends to all other orders of the hierarchy, namely, that the generalized packing radii are upper bounded by the generalized covering radii of the same order. In this paper we prove this conjecture is true for the second order radii. We also prove the conjecture holds for all orders when the code rate is at most 3/5. Finally, we show that for any code rate in (0,1), for all sufficiently long codes the conjecture holds for all orders.
ER  -