Skip to content

Asymptotic Bounds for Codes in Toroidal Distance

Pengjie Zhong, Jinquan Luo

cs.ITarXiv:2611.25990

Abstract

The toroidal distance naturally describes the geometry of codes over \( Zq\), where distances are measured modulo \(q\). In this paper, we study asymptotic bounds for codes in \( Zqn\) under the toroidal metric. We first derive an explicit asymptotic lower bound from the classical Gilbert--Varshamov bounds for the Hamming and Lee metrics, which serves as a baseline for comparison. We then develop a saddle-point approach for the toroidal metric, which yields an asymptotic Gilbert--Varshamov lower bound and an asymptotic Hamming-type upper bound. For \(3 q\), we embed ternary Hamming codes into \( Zqn\) and obtain another asymptotic lower bound for the toroidal metric. In addition, we derive an asymptotic lower bound for Maximum Toroidal Distance (MTD) codes. We compare these lower bounds with the baseline and prove that they are nontrivial in the corresponding parameter ranges. Finally, we compare the asymptotic bounds numerically.

Create a lesson