Pith. sign in

REVIEW 4 minor 53 references

The Hermitian Hull Dimensions for a Class of (L,P)-Twisted Generalized Reed-Solomon Codes

T0 review · 0 major / 4 minor · reviewed 2026-07-11 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Exact Hermitian hull dimensions are determined for a special family of twisted Reed-Solomon codes, yielding new entanglement-assisted quantum codes.

desk verdict Exact Hermitian hull dimensions for one concrete two-row twist family of TGRS codes, fully case-worked and Magma-checked; useful for EAQECC parameters but deliberately narrow. read the letter →

arxiv 2607.03802 v1 pith:U6TFUB3A submitted 2026-07-04 cs.IT math.IT

Chenlu Jia , Zhonghao Liang , Yue Huang , Qunying Liao This is my paper
classification cs.ITmath.IT MSC 94B0594B1581P70
keywords HermitianhulltwistedgeneralizedReed-Solomoncodes(LP)-TGRSentanglement-assistedquantumMDSfinitefields
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper fully computes the dimension of the Hermitian hull for a concrete family of (L,P)-twisted generalized Reed-Solomon codes. The codes are built from a carefully chosen evaluation vector of length i(q-1) and a two-row twist matrix; by splitting into three arithmetic cases according to the parity of i and its greatest common divisor with q+1, the authors obtain an explicit formula that takes only the values j, j-1, j-2 or j+1. Because the hull dimension controls how many shared entangled pairs are needed to build an entanglement-assisted quantum error-correcting code, the formulas immediately produce two infinite families of such quantum codes whose parameters are written down in closed form. A sympathetic reader cares because the Hermitian hull of non-Reed-Solomon MDS-like codes had been known only in scattered special cases; the paper replaces those fragments with a complete case-by-case determination.

What carries the argument

The rank of the Gram matrix GG† under the Hermitian product, reduced by elementary row and column operations to a 2 imes2 block (when gcd(i,q+1)=1) or a 7 imes7 block (when the gcd exceeds 1); the rank of that block is decided by the vanishing of the three polynomials Γ, Γ1, Γ2.

What would settle it

For any concrete prime power q≥7 and admissible i, compute the generator matrix of C_{q+j}(α) over F_{q^{2}}, form GG†, and check whether its rank equals the value predicted by Theorems III.1–III.3; a single mismatch falsifies the claim.

Watch

Extended reading notes

Core claim

For the codes C_{q+j}(α) whose evaluation points are the ordered orbit of length i(q-1) under multiplication by a primitive element and whose twist matrix has only the bottom two rows possibly nonzero, the Hermitian hull dimension equals j, j-1, j-2 or j+1 according to the vanishing of three explicit polynomials Γ, Γ1, Γ2 in the four twist coefficients; the three cases are distinguished solely by whether gcd(i,q+1) equals 1, is greater than 1 and even, or is greater than 1 and odd.

Load-bearing premise

The evaluation points must be the highly structured multiplicative orbit of length exactly i(q-1), and the integer i must satisfy a modular condition that forces a certain 2-by-2 power-sum matrix to have full rank.

Editorial extensions

If this is right

  • Two infinite families of q-ary EAQECCs with parameters [[i(q-1), q-1+m, d, (i-2)(q-1)+m]] and the dual family for m=0,1,2,3 become available.
  • When the four twist coefficients all vanish the formulas recover the known hull dimensions of ordinary GRS codes of the same length.
  • The same rank-reduction technique can be reused for other two-row twist patterns once the corresponding power-sum identities are verified.
  • Explicit Magma-checked examples for q=9,25,27,49 confirm that every arithmetic subcase occurs and attains the predicted dimension.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The restriction to length i(q-1) suggests that similar complete determinations may be possible for other highly symmetric evaluation sets, for instance cyclotomic cosets of different order.
  • Because the hull dimension jumps by at most two when the twist coefficients change, one can design codes whose Hermitian hull dimension is prescribed simply by solving the three polynomial equations Γ=0, Γ1=0 or Γ2=0.
  • The same elementary-transformation strategy that isolates the 2 imes2 or 7 imes7 block is likely to work for the Euclidean hull of the identical family, giving a parallel set of Euclidean results.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper determines the exact Hermitian hull dimension of a special family of (L,P)-TGRS codes C_k(α) with k = q + j (j = (q-3)/2) and a two-row twist matrix B. The evaluation vector α is restricted to the structured form of length i(q-1) built from the subgroup of (q+1)-th powers, under the arithmetic side-conditions i ≡ 0 (mod p) or i^{2} ≡ 1 (mod p) and q ≥ 7. By analysing gcd(i, q+1) and the parity of i, Theorems III.1–III.3 give dim(Hull_H) completely in every subcase; the possible values are j, j-1, j-2 or j+1 according to the vanishing of three explicit polynomials Γ, Γ_{1}, Γ_{2} in the twist coefficients. The proofs reduce GG† via elementary row/column operations (Propositions III.8–III.9) to a 2 imes2 or 7 imes7 block whose entries are power sums controlled by Lemmas II.7–II.25. As an application, two infinite families of EAQECCs with parameters involving m = 0,1,2,3 are obtained (Theorems III.5–III.6). Magma tables in Section IV corroborate every subcase.

Significance. Exact Hermitian-hull formulae for non-GRS codes remain scarce; the paper supplies a complete, case-by-case determination for a concrete and reasonably large family of (L,P)-TGRS codes. The resulting EAQECC constructions inherit the MDS property when the classical code is MDS and give flexible entanglement consumption (m = 0……3). The technical core—explicit power-sum evaluations, full-rank lemmas for the auxiliary matrix D, and exhaustive elementary reductions—is self-contained and machine-checked by Magma examples. Within the deliberately restricted scope the contribution is solid and immediately usable for further constructions of Hermitian LCD or self-orthogonal TGRS codes.

minor comments (4)
  1. Abstract and Introduction: several typographical slips (“calss”, “in short, non-GRS”, repeated “and so”) should be corrected for polish.
  2. Notation: the same symbol α is used both for the evaluation vector and for its components; a brief clarifying sentence in Section II would help the reader.
  3. Section IV tables: the column headers “Our results / Magma output / theoretical value” are slightly redundant; a single “computed / predicted” pair would improve readability.
  4. A short remark after Theorems III.1–III.3 indicating which of the listed subcases recover previously known zero-hull or full-hull results (e.g., Wu et al., Gao et al.) would strengthen the literature comparison.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: exact hull dimensions follow from direct rank computation of GG† via elementary transformations and case analysis on explicit algebraic conditions.

full rationale

The derivation chain is self-contained linear algebra over finite fields. The generator matrix of C_{q+j}(α) is written explicitly (Remark II.2 / (II.1)); GG† is evaluated entrywise by the standard power-sum formula of Lemma II.3 (and Remark II.4), producing the sparse matrix displayed in Proposition III.7. Elementary row/column operations (Propositions III.8–III.9) reduce the rank to that of an explicit 2 imes2 or 7 imes7 block whose entries are polynomials in the four twist coefficients and the quantities e_r. The vanishing of those blocks is then characterized by the algebraic identities of Lemmas II.17–II.25 (proved in Appendix A by direct expansion of geometric sums). Theorems III.1–III.3 simply translate the resulting rank values into dim(Hull_H) via the general identity of Lemma II.5. No parameter is fitted to data, no quantity is defined in terms of the claimed output, and the few self-citations (earlier Euclidean-hull papers of the same group, or the zero-twist recovery of [9]) are not load-bearing for the Hermitian formulas. Magma tables in Section IV independently corroborate every subcase. The special form of α and the arithmetic hypotheses on i are stated scope restrictions, not hidden circular assumptions.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The paper works entirely inside the standard theory of linear codes over finite fields of square order. No free parameters are fitted; the only ‘choices’ are the concrete form of the twist matrix B and the evaluation vector α that define the family under study. All background facts (Hermitian dual, power-sum lemmas, rank-nullity for hull dimension) are classical.

assumptions (3)
  • standard math Hermitian dual and hull dimension satisfy rank(GG†)=k-dim(Hull_H(C)) (Lemma II.5, standard).
    Invoked throughout Section III to convert rank computations into hull dimensions.
  • standard math Power-sum formula of Lemma II.3 (and its specialisation Remark II.4) for geometric progressions of length q-1.
    Used to evaluate every entry of GG† in Proposition III.7.
  • ad hoc to paper The evaluation points α are restricted to the structured set {γ^{s(q+1)}γ^t} of length i(q-1) with the arithmetic side-conditions i≡0 mod p or i²≡1 mod p.
    This choice makes the power sums e_r vanish or not according to simple gcd conditions, enabling the case analysis; it is not forced by the general definition of (L,P)-TGRS codes.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Hermitian Hull Dimensions for a Class of (L,P)-Twisted Generalized Reed-Solomon Codes." pith.science (2026). https://pith.science/paper/U6TFUB3A

@misc{pith2026260703802,
  author       = {Pith},
  title        = {Pith review of: The Hermitian Hull Dimensions for a Class of (L,P)-Twisted Generalized Reed-Solomon Codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/U6TFUB3A}},
  note         = {Machine review of arXiv:2607.03802}
}
read the original abstract

Determining the hull of linear codes has long been an important topic in coding theory. Recently, non-generalized Reed-Solomon (in short, non-GRS) codes have attracted extensive research interest. The (L,P)-twisted generalized Reed-Solomon (in short, (L,P)-TGRS) code, which is an extension of the generalized Reed-Solomon (GRS) code, constitutes a well-studied calss of non-GRS codes.There are numerous works focusing on the Euclidean hull of (L,P)-TGRS codes, while only a few results on the Hermitian hull of (L,P)-TGRS codes. In this paper, we focus on a class of (L,P)-TGRS codes C_k(a). By taking a special class of the vector a with length i(q-1), and analyze the parity of i and the relation between i and q+1, we divide three cases to fully determine the Hermitian hull dimension of C_k(a). As an application, we construct two classes of entanglement-assisted quantum error-correcting codes.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

53 extracted references · 5 linked inside Pith

  1. [1]

    Some constructions of non-generalized Reed-Solomon MDS codes[J]

    Abdukhalikov K, Ding C, Verma G K. Some constructions of non-generalized Reed-Solomon MDS codes[J]. Discrete Mathematics, 2026, 349(10): 115202

    2026

  2. [2]

    Row-Column Twisted Reed-Solomon codes[J]

    Bhagat A K, Singh H, Sarma R. Row-Column Twisted Reed-Solomon codes[J]. arXiv preprint arXiv:2509.06919, 2025

    arXiv 2025

  3. [3]

    Twisted reed-solomon codes[C]//2017 IEEE International Symposium on Information Theory (ISIT)

    Beelen P, Puchinger S, n ´e Nielsen J R. Twisted reed-solomon codes[C]//2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017: 336-340

    2017

  4. [4]

    Some constructions of quantum MDS codes[J]

    Ball S. Some constructions of quantum MDS codes[J]. Designs, Codes and Cryptography, 2021, 89: 811-821

    2021

  5. [5]

    Determining When a Truncated Generalised Reed-Solomon Code Is Hermitian Self-Orthogonal[J]

    Ball S, Vilar R. Determining When a Truncated Generalised Reed-Solomon Code Is Hermitian Self-Orthogonal[J]. IEEE Transactions on Information Theory, 2022, 68(6): 3682-3692

    2022

  6. [6]

    Euclidean and Hermitian LCD MDS codes[J]

    Carlet C, Mesnager S, Tang C, et al. Euclidean and Hermitian LCD MDS codes[J]. Designs, Codes and Cryptography, 2018, 86(11): 2605-2618

    2018

  7. [7]

    On the Hull-Variation Problem of Equivalent Linear Codes[J]

    Chen H. On the Hull-Variation Problem of Equivalent Linear Codes[J]. IEEE Transactions on Information Theory, 2023, 69 (5): 2911-2922

    2023

  8. [8]

    On parity-check matrices of twisted generalized Reed–Solomon codes[J]

    Cheng W. On parity-check matrices of twisted generalized Reed–Solomon codes[J]. IEEE Transactions on Information Theory, 2023, 70(5): 3213-3225

    2023

Show all 53 references
  1. [9]

    Constructions of MDS entanglement-assisted quantum codes with flexible lengths and large minimum distance[J]

    Cheng Y , Cao X, Luo G. Constructions of MDS entanglement-assisted quantum codes with flexible lengths and large minimum distance[J]. Discrete Mathematics, 2024, 347 (9): 114081

    2024

  2. [10]

    Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs[J]

    Fang W, Fu F, Li L, et al. Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs[J]. IEEE Transactions on Information Theory, 2020, 66(6): 3527-3537

    2020

  3. [11]

    Deep holes of twisted Reed-Solomon codes[J]

    Fang W, Xu J, Zhu R. Deep holes of twisted Reed-Solomon codes[J]. Finite Fields and Their Applications, 2025, 108: 102680

    2025

  4. [12]

    On Twisted Generalized Reed-Solomon Codes WithℓTwists[J]

    Gu H, Zhang J. On Twisted Generalized Reed-Solomon Codes WithℓTwists[J]. IEEE Transactions on Information Theory, 2024, 70(1):145-153

    2024

  5. [13]

    Constructions of good entanglement-assisted quantum error correcting codes[J]

    Guenda K, Jitman S, Gulliver T A. Constructions of good entanglement-assisted quantum error correcting codes[J]. Designs, Codes and Cryptography, 2018, 86(1): 121-136

    2018

  6. [14]

    Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes[J]

    Guo G, Li R, Liu Y , et al. Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes[J]. Cryptography and Communications, 2023, 15: 383-395

    2023

  7. [15]

    The error-correcting pair for TGRS codes[J]

    He B, Liao Q. The error-correcting pair for TGRS codes[J]. Discrete Mathematics, 2023, 346(9): 113497

    2023

  8. [16]

    On(L,P)-Twisted Generalized Reed-Solomon Codes[J].IEEE Transactions on Information Theory, 2025, 71(11): 8414-8428

    Hu Z, Wang L, Li N, et al. On(L,P)-Twisted Generalized Reed-Solomon Codes[J].IEEE Transactions on Information Theory, 2025, 71(11): 8414-8428

    2025

  9. [17]

    MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes[J]

    Huang D, Yue Q, Niu Y , et al. MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes[J]. Designs, Codes and Cryptography, 2021, 89: 2195-2209

    2021

  10. [18]

    MDS or NMDS LCD codes from twisted Reed-Solomon codes[J]

    Huang D, Yue Q, Niu Y . MDS or NMDS LCD codes from twisted Reed-Solomon codes[J]. Cryptography and communications, 2023, 15(2): 221-237

    2023

  11. [19]

    Coding properties and automorphism groups of two classes of twisted generalized Reed–Solomon codes[J]

    Jia X, Yue Q, Sun H. Coding properties and automorphism groups of two classes of twisted generalized Reed–Solomon codes[J]. Designs, Codes and Cryptography, 2025: 3107–3133

    2025

  12. [20]

    Bounds on Maximum Hermitian Hull Dimension of MDS Codes and MDS Codes with Explicit Hermitian Hulls[J]

    Lao H, Chen H, Chee Y M, et al. Bounds on Maximum Hermitian Hull Dimension of MDS Codes and MDS Codes with Explicit Hermitian Hulls[J]. IEEE Transactions on Information Theory, 2026, Early Access

    2026

  13. [21]

    Permutation group algorithms based on partitions, I: Theory and algorithms[J]

    Leon J S. Permutation group algorithms based on partitions, I: Theory and algorithms[J]. Journal of Symbolic Computation, 1991, 12(4-5): 533-583

    1991

  14. [22]

    Non-GRS type Euclidean and Hermitian LCD codes and Their Applications for EAQECCs[J]

    Liang Z, Huang D, Liao Q, et al. Non-GRS type Euclidean and Hermitian LCD codes and Their Applications for EAQECCs[J]. arXiv preprint arXiv:2603.16187, 2026

    2026

  15. [23]

    The extended code for a class of generalized Roth-Lempel codes and their properties[J]

    Liang Z, Liao Q. The extended code for a class of generalized Roth-Lempel codes and their properties[J]. Discrete Mathematics, 2026, 349 (8): 115084

    2026

  16. [24]

    The equivalent condition for GRL codes to be MDS, AMDS or self-dual[J]

    Liang Z, Wan Y , Liao Q. The equivalent condition for GRL codes to be MDS, AMDS or self-dual[J]. arXiv preprint arXiv:2506.03874, 2025

    2025

  17. [25]

    Two classes of NMDS codes from Roth-Lempel codes[J]

    Liang Z, Liao Q. Two classes of NMDS codes from Roth-Lempel codes[J]. Finite Fields and Their Applications, 2026, 111: 102779

    2026

  18. [26]

    Four Classes of LCD Codes From(∗)-(L,P)-Twisted Generalized Reed–Solomon Codes[J]

    Liang Z, Liao Q. Four Classes of LCD Codes From(∗)-(L,P)-Twisted Generalized Reed–Solomon Codes[J]. IEEE Transactions on Information Theory, 2026, 72(7): 4788-4801

    2026

  19. [27]

    Multi-Twisted Generalized Reed-Solomon Codes: Structure, Properties, and Construc- tions[J]

    Liang Z, Jia C, Huang D, et al. Multi-Twisted Generalized Reed-Solomon Codes: Structure, Properties, and Construc- tions[J]. arXiv preprint arXiv:2511.03398, 2025

    2025

  20. [28]

    Construction of MDS twisted Reed–Solomon codes and LCD MDS codes[J]

    Liu H, Liu S. Construction of MDS twisted Reed–Solomon codes and LCD MDS codes[J]. Designs, Codes and Cryptography, 2021, 89: 2051-2065

    2021

  21. [29]

    Constructions of Non-Generalized Reed-Solomon MDS Codes[J]

    Liu S, Liu H, Oggier F. Constructions of Non-Generalized Reed-Solomon MDS Codes[J]. IEEE Transactions on Information Theory, 2026, 72(4): 2112-2122

    2026

  22. [30]

    Column Twisted Reed-Solomon Codes as MDS Codes[J]

    Liu W, Luo J, Wang P, et al. Column Twisted Reed-Solomon Codes as MDS Codes[J]. IEEE Transactions on Information 25 Theory, 2026, Early Access

    2026

  23. [31]

    On Linear Codes Whose Hermitian Hulls are MDS[J]

    Luo G, Lin S, Ezerman M F, et al. On Linear Codes Whose Hermitian Hulls are MDS[J]. IEEE Transactions on Information Theory, 2024, 70(7): 4767-4778

    2024

  24. [32]

    Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications[J]

    Luo G, Cao X, Ezerman M F, et al. Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications[J]. Advances in Mathematics of Communications, 2022, 16(4): 921-933

    2022

  25. [33]

    MDS codes with Euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs[J]

    Li Y , Wan R, Zhu S. MDS codes with Euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs[J]. Quantum Information Processing, 2023, 22: 153

    2023

  26. [34]

    Covering radii and deep holes of two classes of extended twisted GRS codes and their applications[J]

    Li Y , Zhu S, Sun Z. Covering radii and deep holes of two classes of extended twisted GRS codes and their applications[J]. IEEE Transactions on Information Theory, 2025

    2025

  27. [35]

    Hulls of special typed linear codes and constructions of new EAQECCs[J]

    Lin S. Hulls of special typed linear codes and constructions of new EAQECCs[J]. arXiv preprint arXiv:2207.07792, 2022

    2022 arXiv

  28. [36]

    A class of triple-twisted GRS codes[J]

    Meena K C, Pachauri P, Awasthi A, et al. A class of triple-twisted GRS codes[J]. Designs, Codes and Cryptography, 2025: 2369–2393

    2025

  29. [37]

    Constructing Two Classes of Maximum Distance Separable Entanglement-Assisted Quantum Error- Correcting Codes by Using Twisted Generalized Reed-Solomon Codes (in Chinese) [J]

    Pan X, Gao J. Constructing Two Classes of Maximum Distance Separable Entanglement-Assisted Quantum Error- Correcting Codes by Using Twisted Generalized Reed-Solomon Codes (in Chinese) [J]. Journal of Electronics & Information Technology, 2025, 47(12): 1-10

    2025

  30. [38]

    Finding the permutation between equivalent linear codes: The support splitting algorithm[J]

    Sendrier N. Finding the permutation between equivalent linear codes: The support splitting algorithm[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1193-1203

    2000

  31. [39]

    MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes[J]

    Sui J, Yue Q, Li X, et al. MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes[J]. IEEE Transactions on Information Theory, 2022, 68 (12): 7832-7841

    2022

  32. [40]

    New constructions of self-dual codes via twisted generalized Reed–Solomon codes[J]

    Sui J, Yue Q, Sun F. New constructions of self-dual codes via twisted generalized Reed–Solomon codes[J]. Cryptography and Communications, 2023, 15: 959-978

    2023

  33. [41]

    New Constructions of Non-GRS MDS Codes, Recovery and Determination Algorithms for GRS Codes[J]

    Wang G, Liu H, Luo J. New Constructions of Non-GRS MDS Codes, Recovery and Determination Algorithms for GRS Codes[J]. IEEE Transactions on Information Theory, 2026, 72(6): 3848-3862

    2026

  34. [42]

    Twisted Reed–Solomon codes with one-dimensional hull[J]

    Wu Y . Twisted Reed–Solomon codes with one-dimensional hull[J]. IEEE Communications Letters, 2020, 25(2): 383-386

    2020

  35. [43]

    New LCD MDS codes of non-Reed-Solomon type[J]

    Wu Y , Hyun J Y , Lee Y . New LCD MDS codes of non-Reed-Solomon type[J]. IEEE Transactions on Information Theory, 2021, 67(8): 5069-5078

    2021

  36. [44]

    More MDS codes of non-Reed-Solomon type[J]

    Wu Y , Heng Z, Li C, et al. More MDS codes of non-Reed-Solomon type[J]. arXiv preprint arXiv:2401.03391, 2024

    2024 arXiv

  37. [45]

    Two classes of twisted generalized Reed-Solomon codes with two twists[J]

    Yang S, Wang J, Wu Y . Two classes of twisted generalized Reed-Solomon codes with two twists[J]. Finite Fields and Their Applications, 2025, 104: 102595

    2025

  38. [46]

    Almost self-dual MDS codes and NMDS codes from twisted generalized Reed-Solomon codes[J]

    Zhang Y , Ding Y . Almost self-dual MDS codes and NMDS codes from twisted generalized Reed-Solomon codes[J]. Journal of Algebra and Its Applications, 2025, 25(8): 2650227

    2025

  39. [47]

    A class of twisted generalized Reed–Solomon codes[J]

    Zhang J, Zhou Z, Tang C. A class of twisted generalized Reed–Solomon codes[J]. Designs, Codes and Cryptography, 2022, 90(7): 1649-1658

    2022

  40. [48]

    Research on the construction for Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes[J]

    Zhao C, Ma W, Yan T, et al. Research on the construction for Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes[J]. IEEE Transactions on Information Theory, 2025, 71(7): 5130-5143

    2025

  41. [49]

    Hermitian Self-dual Twisted Generalized Reed-Solomon Codes[J]

    Zhao C, Han Y , Ma W, et al. Hermitian Self-dual Twisted Generalized Reed-Solomon Codes[J]. arXiv preprint arXiv:2508.09687, 2025

    2025 arXiv

  42. [50]

    The (+)-extended twisted generalized Reed-Solomon code[J]

    Zhu C, Liao Q. The (+)-extended twisted generalized Reed-Solomon code[J]. Discrete Mathematics, 2024, 347: 113749

    2024

  43. [51]

    A class of double-twisted generalized Reed-Solomon codes[J]

    Zhu C, Liao Q. A class of double-twisted generalized Reed-Solomon codes[J]. Finite Fields and Their Applications, 2024, 95: 102395

    2024

  44. [52]

    The [1, 0]-twisted generalized Reed-Solomon code[J]

    Zhu C, Liao Q. The [1, 0]-twisted generalized Reed-Solomon code[J]. Cryptography and Communications, 2024, 16(4): 857-878

    2024

  45. [53]

    1 +γ i(1−q) 1 +γ 1−q 2 − 1 +γ 2i(1−q) 1 +γ 2(1−q) # · 1 +γ i(q−1) 1 +γ q−1 +b q k−1,1

    Zhu C, Liao Q. Self-orthogonal generalized twisted Reed-Solomon codes[J]. arXiv preprint arXiv:2201.02758, 2022. 26 APPENDIXA PROOFS OFSEVERALLEMMAS The proof of Lemma II.12 By2|iand Lemma II.11, we havee j+2 = 0. Ife j =e j+2 = 0, then by Lemma II.9, we havek j+2 ∈Zandk j ∈Z,...

    2022 arXiv

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.