A Class of Double-twisted Generalized Reed-Solomon Codes and Their Extended Codes

CHENG Hongli; ZHU Shixin

doi:10.11999/JEIT251045

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2026 >

CHENG Hongli, ZHU Shixin. A Class of Double-twisted Generalized Reed-Solomon Codes and Their Extended Codes[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251045

Citation:

CHENG Hongli, ZHU Shixin. A Class of Double-twisted Generalized Reed-Solomon Codes and Their Extended Codes[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251045

CHENG Hongli, ZHU Shixin. A Class of Double-twisted Generalized Reed-Solomon Codes and Their Extended Codes[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251045

Citation:

CHENG Hongli, ZHU Shixin. A Class of Double-twisted Generalized Reed-Solomon Codes and Their Extended Codes[J]. Journal of Electronics & Information Technology. doi: 10.11999/JEIT251045

PDF( 749 KB)

A Class of Double-twisted Generalized Reed-Solomon Codes and Their Extended Codes

doi: 10.11999/JEIT251045 cstr: 32379.14.JEIT251045

CHENG Hongli^,,
ZHU Shixin

School of Mathematics, Hefei University of Technology, Hefei 230601, China

Funds: National Natural Science Foundation of China (12171134, U21A20428)

Accepted Date: 2025-12-29
Rev Recd Date: 2025-12-29

Available Online: 2026-01-17

Abstract

Abstract

Objective In the field of coding theory, Twisted Generalized Reed-Solomon (TGRS) codes have attracted considerable research interest for their flexible structural properties. However, investigations into their extended codes remain relatively limited. Existing literature indicates that prior studies on extended TGRS codes are scarce, with only a few works delving into this area, thereby leaving significant gaps in our understanding of their error-correcting capabilities, duality properties, and practical applications. Meanwhile, the foundational parity-check matrix forms for TGRS codes presented in earlier research lack sufficient clarity and exhibit restricted parameter coverage. Specifically, previous studies fail to accommodate scenarios involving h=0, which constrains their utility in broader coding scenarios where diverse parameter configurations are required. Furthermore, constructing non-GRS codes is an intriguing and critical research topic due to their unique characteristics to resist Sidelnikov-Shestakov and Wieschebrink attacks, whereas GRS codes are vulnerable to such threats. Additionally, Maximum Distance Separable (MDS) codes, self-orthogonal codes, and almost self-dual codes are highly valued for their efficient error-correcting capabilities and structural advantages. MDS codes, achieving the Singleton bound, are essential for distributed storage systems where data integrity under node failures is critical; self-orthogonal and almost self-dual codes, with their inherent duality properties, play key roles in quantum coding, secret sharing schemes, and secure multi-party computation, where structural regularity and cryptographic security are vital. Accordingly, this paper aims to achieve the following goals: (1) characterize the MDS and Almost MDS (AMDS) properties of double-twisted GRS codes$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v}) $and their extended codes$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v},\mathrm{\infty }) $; (2) derive explicit and unified parity-check matrices applicable to all valid parameter ranges, including h=0; (3) establish non-GRS properties of these codes under specific parameter conditions; (4) provide rigorous necessary and sufficient conditions for the extended codes to be self-orthogonal and for the original codes to be almost self-dual; and (5) construct a class of almost self-dual double-twisted GRS codes with flexible parameters to meet diverse application requirements in secure and reliable communication systems. Methods The research adopts a comprehensive framework rooted in algebraic coding theory and finite field mathematics. Algebraic Analysis serves as a foundational tool: explicit parity-check matrices are derived using properties of polynomial rings over finite fields $ {F}_{q} $, Vandermonde matrices structures, and polynomial interpolation techniques; The Schur Product Method is utilized to determine non-GRS properties by evaluating the dimension of the Schur square of codes and their duals, distinguishing them from GRS codes; Linear Algebra and Combinatorics are utilized to characterize MDS and AMDS properties. By examining the non-singularity of generator matrix submatrices and solving systems of equations involving symmetric sums of finite field elements, the conditions for MDS and AMDS codes are derived. These conditions rely on sets$ {S}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $,$ {L}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $, and$ {D}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $, which are defined based on sums of products of finite field elements. Duality theory forms the foundation for analyzing orthogonality. For self-orthogonal codes$ C\subseteq {C}^{\bot } $, the generator matrix must satisfy$ G{G}^{\rm T}=\boldsymbol{O} $. For almost self-dual codes (length-odd, dimension-(n-1)/2 self-orthogonal codes), this condition is combined with structural properties of dual codes and symmetric sum relations of $ {\alpha }_{i} $ to derive necessary and sufficient conditions. Results and Discussions For MDS and AMDS properties, critical findings are established: The extended double-twisted GRS code$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v},\mathrm{\infty }) $is MDS if and only if$ 1\notin {S}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $and$ 1\notin {L}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $; the double-twisted GRS code$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v}) $is AMDS if and only if$ 1\in {S}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $and$ (0,1)\notin {D}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $; and$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v}) $is neither MDS nor AMDS if and only if$ (0,1)\in {D}_{k}(\boldsymbol{\alpha },\boldsymbol{\eta }) $. Unified parity-check matrices of$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v}) $and$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v},\mathrm{\infty }) $ for all$ 0\leq h\leq k-1 $are derived, resolving prior limitations that excluded h=0 by removing restrictive submatrix structure constraints. For non-GRS properties, when$ k\geq 4 $and$ n-k\geq 4 $, $ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v}) $and its extened codes $ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v},\mathrm{\infty }) $are non-GRS regardless of$ 2k\geq n $or$ 2k \lt n $, confirmed by the dimension of their Schur squares exceeding that of corresponding GRS codes. This ensures resistance to Sidelnikov-Shestakov and Wieschebrink attacks. Regarding self-orthogonality and almost self-duality, the extended code$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v},\mathrm{\infty }) $with$ h=k-1 $is self-orthogonal under specific algebraic conditions;$ {C}_{k,\boldsymbol{h},\boldsymbol{\eta }}(\boldsymbol{\alpha },\boldsymbol{v}) $with$ h=k-1 $and$ n=2k+1 $is almost self-dual if and only if there exists$ \lambda \in F_{q}^{*} $such as$ \lambda {u}_{j}=v_{j}^{2} (j=1,\cdots ,2k+1) $and a symmetric sum constraint on$ {\alpha }_{i} $involving$ {\eta }_{1} $and$ {\eta }_{2} $holds. For odd prime power$ q $, a flexible almost self-dual code with parameters$ [q-t-1,(q-t-2)/2,\geq (q-t-2)/2] $is constructed using roots of $ m(x)=({x}^{q}-x)/f(x) $ where $ f(x)={x}^{t+1}-x $, with an example over$ {F}_{11} $yielding a$ [5,2,\geq 2] $code. Conclusions This work advances the study of double-twisted GRS codes and their extensions through key contributions: (1) complete characterization of MDS and AMDS properties via explicit combinatorial sets$ {S}_{k} $,$ {L}_{k} $,$ {D}_{k} $, enabling precise error-correcting capability assessment; (2) derivation of unified, explicit parity-check matrices for all$ 0\leq h\leq k-1 $, overcoming prior parameter restrictions and enhancing practical utility; (3) proof of non-GRS properties for$ k\geq 4 $, ensuring security against specific attacks; (4) rigorous conditions for self-orthogonal extended codes and almost self-dual original codes, deepening structural insights; (5) a flexible construction of almost self-dual codes, meeting diverse needs in secure communication and distributed storage. These results enrich coding theory and provide practical tools for robust, secure coding system design.
- Maximum Distance Separable (MDS) codes,
- Almost self-dual codes,
- Non-Generalized Reed-Solomon (Non-GRS) codes,
- Double-twisted GRS codes,
- Schur square

FullText(HTML)

References(22)

References

[1]	HUFFMAN W C and PLESS V. Fundamentals of Error-Correcting Codes[M]. Cambridge: Cambridge University Press, 2003: 71–72. doi: 10.1017/CBO9780511807077.
[2]	THOMAS A and RAJAN B S. Binary informed source codes and index codes using certain near-MDS codes[J]. IEEE Transactions on Communications, 2018, 66(5): 2181–2190. doi: 10.1109/TCOMM.2018.2789457.
[3]	ZHOU Yousheng, WANG Feng, XIN Yang, et al. A secret sharing scheme based on near-MDS codes[C]. 2009 IEEE International Conference on Network Infrastructure and Digital Content, Beijing, China, 2009: 833–836. doi: 10.1109/ICNIDC.2009.5360821.
[4]	CADAMBE V R, HUANG Cheng, and LI Jin. Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems[C]. 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russia, 2011: 1225–1229. doi: 10.1109/ISIT.2011.6033730.
[5]	KIM J L and LEE Y. Euclidean and Hermitian self-dual MDS codes over large finite fields[J]. Journal of Combinatorial Theory, Series A, 2004, 105(1): 79–95. doi: 10.1016/j.jcta.2003.10.003.
[6]	FANG Xiaolei, LIU Meiqing, and LUO Jinquan. New MDS Euclidean self-orthogonal codes[J]. IEEE Transactions on Information Theory, 2021, 67(1): 130–137. doi: 10.1109/TIT.2020.3020986.
[7]	WU Rongsheng and SHI Minjia. A modified Gilbert-Varshamov bound for self-dual quasi-twisted codes of index four[J]. Finite Fields and Their Applications, 2020, 62: 101627. doi: 10.1016/j.ffa.2019.101627.
[8]	MACWILLIAMS F J and SLOANE N J A. The Theory of Error-Correcting Codes[M]. Amsterdam: North-Holland Publishing Company, 1977: 303–305. doi: 10.1137/1022103.
[9]	BEELEN P, PUCHINGER S, and NIELSEN J R N. Twisted Reed-Solomon codes[C]. 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 2017: 336–340. doi: 10.1109/ISIT.2017.8006545.
[10]	SUI Junzhen, YUE Qin, and SUN Fuqing. New constructions of self-dual codes via twisted generalized Reed-Solomon codes[J]. Cryptography and Communications, 2023, 15(5): 959–978. doi: 10.1007/s12095-023-00644-4.
[11]	ZHU Canze and LIAO Qunying. The (+)-extended twisted generalized Reed-Solomon code[J]. Discrete Mathematics, 2024, 347(2): 113749. doi: 10.1016/j.disc.2023.113749.
[12]	ZHU Canze and LIAO Qunying. A class of double-twisted generalized Reed-Solomon codes[J]. Finite Fields and Their Applications, 2024, 95: 102395. doi: 10.1016/j.ffa.2024.102395.
[13]	DING Yun and ZHU Shixin. New self-dual codes from TGRS codes with general $ \ell $ twists[J]. Advances in Mathematics of Communications, 2025, 19(2): 662–675. doi: 10.3934/amc.2024017.
[14]	BEELEN P, BOSSERT M, PUCHINGER S, et al. Structural properties of twisted Reed-Solomon codes with applications to cryptography[C]. 2018 IEEE International Symposium on Information Theory, Vail, USA, 2018: 946–950. doi: 10.1109/ISIT.2018.8437923.
[15]	ZHAO Chun’e, MA Wenping, YAN Tongjiang, et al. Research on the construction of maximum distance separable codes via arbitrary twisted generalized Reed-Solomon codes[J]. IEEE Transactions on Information Theory, 2025, 71(7): 5130–5143. doi: 10.1109/TIT.2025.3563664.
[16]	FANG Weijun and XU Jingke. Deep holes of twisted Reed-Solomon codes[C]. 2024 IEEE International Symposium on Information Theory, Athens, Greece, 2024: 488–493. doi: 10.1109/ISIT57864.2024.10619676.
[17]	YAN Qianqian and ZHOU Junling. Mutually disjoint Steiner systems from BCH codes[J]. Designs, Codes and Cryptography, 2024, 92(4): 885–907. doi: 10.1007/s10623-023-01319-0.
[18]	LI Zhuo, XING Lijuan, and WANG Xinmei. Quantum generalized Reed-Solomon codes: Unified framework for quantum maximum-distance-separable codes[J]. Physical Review A, 2008, 77(1): 012308. doi: 10.1103/PhysRevA.77.012308.
[19]	LI Yang, ZHU Shixin, and SUN Zhonghua. Covering radii and deep holes of two classes of extended twisted GRS codes and their applications[J]. IEEE Transactions on Information Theory, 2025, 71(5): 3516–3530. doi: 10.1109/TIT.2025.3541799.
[20]	SUN Zhonghua, DING Cunsheng, and CHEN Tingfang. The extended codes of some linear codes[J]. Finite Fields and Their Applications, 2024, 96: 102401. doi: 10.1016/j.ffa.2024.102401.
[21]	LIU Hongwei and PAN Xu. Galois hulls of linear codes over finite fields[J]. Designs, Codes and Cryptography, 2020, 88(2): 241–255. doi: 10.1007/s10623-019-00681-2.
[22]	LIDL R and NIEDERREITER H. Finite Fields[M]. Cambridge: Cambridge University Press, 1996: 513–516. doi: 10.1017/CBO9780511525926.