Asymptotically Good Multi-twisted Codes over Finite Chain Rings

GAO Jian; CUI Qingxiang; ZHENG Yuqi

doi:10.11999/JEIT250032

Volume 47 Issue 8

Aug. 2025

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2025 > 47(8): 2800-2807

GAO Jian, CUI Qingxiang, ZHENG Yuqi. Asymptotically Good Multi-twisted Codes over Finite Chain Rings[J]. Journal of Electronics & Information Technology, 2025, 47(8): 2800-2807. doi: 10.11999/JEIT250032

Citation:

GAO Jian, CUI Qingxiang, ZHENG Yuqi. Asymptotically Good Multi-twisted Codes over Finite Chain Rings[J]. Journal of Electronics & Information Technology, 2025, 47(8): 2800-2807. doi: 10.11999/JEIT250032

Citation:

PDF( 787 KB)

Asymptotically Good Multi-twisted Codes over Finite Chain Rings

doi: 10.11999/JEIT250032 cstr: 32379.14.JEIT250032

School of Mathematics and Statistics, Shandong University of Technology, Zibo 255000, China

Funds: The Natural Science Foundation of Shandong Province (ZR2024YQ057, ZR2022MA024), The National Natural Science Foundation of China (12071264)

Received Date: 2025-01-14
Rev Recd Date: 2025-05-21

Available Online: 2025-06-07

Publish Date: 2025-08-27

Abstract

Abstract

Objective This study aims to address the theoretical gap in the asymptotic analysis of multi-twisted codes over finite chain rings and to provide a foundation for their application in high-efficiency communication and secure data transmission. As modern communication systems demand higher data rates, enhanced error resilience, and robust security, the design of error-correcting codes must balance code rate, error correction capability, and implementation complexity. Finite chain rings, as algebraic structures situated between finite fields and general rings, exhibit a hierarchical ideal structure, that enables sophisticated code designs while retaining the algebraic properties of linear codes. Compared to finite fields, codes over finite chain rings achieve flexible error correction and higher information density through homogeneous weights and Gray mapping. However, existing research has focused primarily on multi-twisted codes over finite fields, leaving the asymptotic properties over finite chain rings unexplored. By constructing 1-generator multi-twisted codes, this work is the first to prove their asymptotic goodness over finite chain rings—i.e., the existence of infinite code sequences$ {\mathcal{C}_i} $with code rate$ R\left( {{\mathcal{C}_i}} \right) $and relative distance$ {{\Delta }}\left( {{\mathcal{C}_i}} \right) $bounded below as code lengths approach infinity. This result not only demonstrates the attainability of Shannon’s Second Theorem in finite chain ring coding but also offers novel solutions for practical systems, such as quantum-resistant encrypted communication and reliable transmission in high-noise channels. Methods In the basic concepts section, the structure of a finite chain ring is defined, utilizing its ideal chain structure to study code generation and properties. The concepts of homogeneous weight are introduced, and the homogeneous distance ${d_{\hom }}$ is established to quantify error correction capabilities. A Gray map is constructed to transform the distance problems over finite chain rings into Hamming distance problems over finite fields. To study the asymptotic properties of multi-twisted codes, 1-generator multi-twisted codes are defined using the module structure of $ {{R}}\left[ x \right] $, and their free condition is discussed, as demonstrated in Theorem 1: Each subcode $ {\mathcal{C}_i} = \left\langle {{a_i}\left( x \right)} \right\rangle $ must be a free constant cyclic code, and the rank of $ {\mathcal{C}_i} $ is determined by the degree of the check polynomial$ h(x) $. The asymptotic properties of multi-twisted codes with identical block lengths, which are simpler to analyze than those with varying block lengths are considered. The selection of generators $ ({a_1}(x),{a_2}(x), \ldots ,{a_l}(x)) $ is treated as a random process, defining a probability space. By introducing the ${q^s}$-ary entropy function$ H(x) = x{\log _{{q^s}}}({q^s} - 1) - x{\log _{{q^s}}}x - (1 - x){\log _{{q^s}}}(1 - x) $, the code rate$ R(\mathcal{C}) $and the relative distance $ {{\Delta }}(\mathcal{C}) $ are analyzed. The Chinese Remainder Theorem is applied to decompose the finite chain ring into the direct product of local rings, transforming the global ideal analysis into localized studies to reduce complexity. Finally, it is proven that the relative homogeneous distance and the rate of multi-twisted codes are positively bounded from below. As the code length$ i \to \infty $, the relative distance of the code satisfies $ \Pr \left( {{{\Delta }}\left( {{\mathcal{C}^{\prime (i)}}} \right) \ge \delta } \right) = 1 $(Theorem 2) and $ \Pr \left( {{\text{rank}}\left( {{\mathcal{C}^{\prime (i)}}} \right) = {m_i} - 1} \right) = 1 $(Theorem 3), leading to the conclusion that this class of multi-twisted codes over finite chain rings is asymptotically good. Results and Discussions This paper systematically constructs a class of 1-generator multi-twisted codes (Label 1) over finite chain rings and demonstrates that these codes are asymptotically good based on probabilistic methods and the Chinese Remainder Theorem. This constitutes the first analysis of the asymptotic properties of such codes over finite chain rings. Previous studies on the asymptotic properties of codes have primarily focused on codes over finite fields (e.g., cyclic and quasi-cyclic codes). By leveraging the hierarchical ideal structures of rings (e.g., homogeneous weight and the Chinese Remainder Theorem), the analytical complexity inherent to rings is overcome, thereby extending the scope of asymptotically good codes. This work extends classical finite-field random code analysis to finite chain rings, addressing the complexity of distance computation through complexity via homogeneous weights and Gray mappings. Additionally we leverage the bijection between q-cyclotomic cosets modulo ${{M}}$ and irreducible factors of ${x^{{M}}} - 1$, combined with CRT-based ideal decomposition, significantly simplifies the asymptotic analysis (Lemma 4). Conclusions The asymptotic goodness of multi-twisted codes over finite chain rings has been systematically resoloved, addressing a critical theoretical gap. By constructing 1-generator free codes and applying probabilistic methods combined with the Chinese Remainder Theorem, this work provides the first proof of infinite code sequences over finite chain rings that approach Shannon’s theoretical limits in terms of code rate and relative distance. These codes are suitable for high-frequency communications in 5G/6G networks, deep-space links, and other noisy environments, offering enhanced spectral efficiency through high code rates and robust error correction. This result not only extends the algebraic framework of coding theory but also provides a new coding scheme with strong anti-interference capabilities and high security for practical communication systems. Future research may extend these findings to more complex ring structures and practical application scenarios, further advancing the application of coding theory in the information age.
- Multi-twisted codes,
- Finite chain rings,
- Asymptotic properties

FullText(HTML)

References(24)

References

[1]	AYDIN N and HALILOVIĆ A. A generalization of quasi-twisted codes: Multi-twisted codes[J]. Finite Fields and Their Applications, 2017, 45: 96–106. doi: 10.1016/j.ffa.2016.12.002.
[2]	SHARMA A, CHAUHAN V, and SINGH H. Multi-twisted codes over finite fields and their dual codes[J]. Finite Fields and Their Applications, 2018, 51: 270–297. doi: 10.1016/j.ffa.2018.01.012.
[3]	SHARMA A and CHAUHAN V. Skew multi-twisted codes over finite fields and their Galois duals[J]. Finite Fields and Their Applications, 2019, 59: 297–334. doi: 10.1016/j.ffa.2019.06.005.
[4]	CHAUHAN V, SHARMA A, SHARMA S, et al. Hamming weight distributions of multi-twisted codes over finite fields[J]. Designs, Codes and Cryptography, 2021, 89(8): 1787–1837. doi: 10.1007/s10623-021-00889-1.
[5]	CHAUHAN V and SHARMA A. A generalization of multi-twisted codes over finite fields, their Galois duals and type II codes[J]. Journal of Applied Mathematics and Computing, 2022, 68(2): 1413–1447. doi: 10.1007/s12190-021-01574-1.
[6]	MAHMOUDI S and SAMEI K. Every ${\mathbb{F}_q}$-linear code is equivalent to a multi-twisted code[J]. Advances in Mathematics of Communications, 2025, 19(2): 560–571. doi: 10.3934/amc.2024011.
[7]	MARTINEZ-PEREZ C and WILLEMS W. Is the class of cyclic codes asymptotically good?[J]. IEEE Transactions on Information Theory, 2006, 52(2): 696–700. doi: 10.1109/TIT.2005.862123.
[8]	FAN Yun and LIN Liren. Thresholds of random quasi-Abelian codes[J]. IEEE Transactions on Information Theory, 2015, 61(1): 82–90. doi: 10.1109/TIT.2014.2368138.
[9]	FAN Yun and LIU Hualu. Quasi-cyclic codes of index $1\frac{1}{3}$[J]. IEEE Transactions on Information Theory, 2016, 62(11): 6342–6347. doi: 10.1109/TIT.2016.2602842.
[10]	MI Jiafu and CAO Xiwang. Asymptotically good quasi-cyclic codes of fractional index[J]. Discrete Mathematics, 2018, 341(2): 308–314. doi: 10.1016/j.disc.2017.08.042.
[11]	GAO Jian and HOU Xiaotong. $ {\mathbb{Z}_4} $-double cyclic codes are asymptotically good[J]. IEEE Communications Letters, 2020, 24(8): 1593–1597. doi: 10.1109/LCOMM.2020.2992501.
[12]	ZHU Hongwei and SHI Minjia. Several classes of asymptotically good quasi-twisted codes with a low index[J]. Journal of Applied Mathematics and Computing, 2022, 68(2): 1227–1244. doi: 10.1007/s12190-021-01564-3.
[13]	SHARMA S and SHARMA A. Multi-twisted additive codes over finite fields are asymptotically good[J]. Cryptography and Communications, 2023, 15(1): 17–33. doi: 10.1007/s12095-022-00583-6.
[14]	SHARMA S and SHARMA A. Multi-twisted additive self-orthogonal and ACD codes are asymptotically good[J]. Finite Fields and Their Applications, 2024, 93: 102319. doi: 10.1016/j.ffa.2023.102319.
[15]	姚婷, 唐永生, 许和乾. 渐近好的加性循环码的存在性[J]. 系统科学与数学, 2024, 44(12): 3779–3789. doi: 10.12341/jssms240011. YAO Ting, TANG Yongsheng, and XU Heqian. Asymptotically good additive cyclic codes exist[J]. Journal of Systems Science and Mathematical Sciences, 2024, 44(12): 3779–3789. doi: 10.12341/jssms240011.
[16]	GHOSH M, PATHAK S, and MAITY D. On $ {\mathbb{Z}_{{p^r}}}{\text{ }}{\mathbb{Z}_{{p^s}}}{\text{ }}{\mathbb{Z}_{{p^t}}}{\text{ }} $-additive cyclic codes exhibit asymptotically good properties[J]. Cryptography and Communications, 2024, 16(6): 1559–1580. doi: 10.1007/s12095-024-00737-8.
[17]	YADAV B P. $ {\mathbb{F}_p}RS $-additive cyclic codes are asymptotically good[J]. IEEE Access, 2024, 12: 194598–194608. doi: 10.1109/ACCESS.2024.3519440.
[18]	MENG Xiangrui, GAO Jian, and FU Fangwei. Asymptotically good generalized quasi-cyclic codes over finite chain rings[J]. Advances in Mathematics of Communications, 2025, 19(1): 36–48. doi: 10.3934/amc.2023034.
[19]	ZHANG Guanghui, LIN Liren, and LIU Xuemei. Asymptotically good LCD 2-quasi-abelian codes over finite fields[J]. Discrete Mathematics, 2025, 348(1): 114224. doi: 10.1016/j.disc.2024.114224.
[20]	NORTON G H and SĂLĂGEAN A. On the structure of linear and cyclic codes over a finite chain ring[J]. Applicable Algebra in Engineering, Communication and Computing, 2000, 10(6): 489–506. doi: 10.1007/PL00012382.
[21]	JITMAN S and UDOMKAVANICH P. The Gray image of codes over finite chain rings[J]. arXiv preprint arXiv: 0907.3397, 2009.
[22]	JITMAN S, LING S, and UDOMKAVANICH P. Skew constacyclic codes over finite chain rings[J]. Advances in Mathematics of Communications, 2012, 6(1): 39–63. doi: 10.3934/amc.2012.6.39.
[23]	MITZENMACHER M and UPFAL E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis[M]. New York: Cambridge University Press, 2005.
[24]	BAZZI L M J and MITTER S K. Some randomized code constructions from group actions[J]. IEEE Transactions on Information Theory, 2006, 52(7): 3210–3219. doi: 10.1109/TIT.2006.876244.