Covering Radius and Deep Holes of Hyperderivative Reed-Solomon Codes under the NRT Metric

@misc{zhu2026covering,
  title = {{Covering Radius and Deep Holes of Hyperderivative Reed-Solomon Codes under the NRT Metric}},
  author = {Zhihao Zhu and Haojie Gu and Jun Zhang and Yu Li},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.16643},
  eprint = {2610.16643},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.16643},
}

TY  - UNPB
TI  - Covering Radius and Deep Holes of Hyperderivative Reed-Solomon Codes under the NRT Metric
AU  - Zhihao Zhu
AU  - Haojie Gu
AU  - Jun Zhang
AU  - Yu Li
PY  - 2026
DA  - 2026/10/12
PB  - arXiv
DO  - 10.48550/arxiv.2610.16643
UR  - https://arxiv.org/abs/2610.16643
AB  - The deep hole problem is a fundamental problem in coding theory, and it has many important applications in code constructions and cryptography. The deep hole problem of Reed-Solomon codes has gained a lot of attention. As a generalization of Reed-Solomon codes under Hamming metric, we study the covering radius and deep holes of Hyperderivative Reed-Solomon (HRS) codes under the Niederreiter-Rosenbloom-Tsfasman (NRT) metric. We determine the NRT covering radius of HRS code and characterize its NRT deep holes via Maximum Distance Separable (MDS) extensions and polynomial remainder conditions. We further relate the enumeration of NRT deep holes to the characteristic polynomial of an associated hyperplane arrangement. We also provide three classes of explicit NRT deep-hole constructions, propose a Cheng-Murray type conjecture for HRS codes under the NRT metric and obtain a conditional low-layer description. Using these characterizations, we derive exact enumeration formulas in several special cases.
ER  -