Asymptotic Bounds for Codes in Toroidal Distance
Pengjie Zhong, Jinquan Luo
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
Related papers
Optimal Preemption: Guaranteeing Information Freshness in Mean Age and Beyond
Aimin Li, Yiğit İnce, Elif Uysal
Spherical Tessellation of Circular Arrays for Massive MIMO: Favourable Propagation Conditions and Spectral Design
Geili T A El Sanousi, Tuan Anh Le, Raed A A Abd-Alhameed et al.
Physics-Informed Deep Learning for Channel Prediction in Satellite-Mounted Metasurface Reflection Communication Networks
Aolin Sun, Ruihong Jiang, Jincong Mo et al.
Two-Timescale Channel Estimation and Port Selection for Fluid Antenna Systems With Limited Port Observations
Xusheng Zhu, Kai-Kit Wong, Jiajian Wang et al.
Feedback-Free FDD Cell-Free Massive MIMO With Sparse AP Activation and Dual-Mode Precoding
Wei Jiang, Hans Dieter Schotten
Self-Orthogonal MDS Principal-Ideal Codes
Yangcheng Li, Pingzhi Yuan