Jinquan Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jinquan Luo has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Wen Ma
School of Science, Nanjing Forestry University, Nanjing, China
10 shared publications - Xiaolei Fang
School of Mathematics and Statistics & Hubei Key Laboratory of Mathematical Sciences, Central China Normal University, Wuhan, China
8 shared publications - Derong Xie
School of Mathematics and Statistics & Hubei Key Laboratory of Mathematical Sciences Central China Normal University 430079. Wuhan China
7 shared publications - Renjie Jin
School of Mathematics and Statistics & Hubei Key Laboratory of Mathematical Sciences Central China Normal University 430079 Wuhan China
6 shared publications - Hongwei Liu
Central China Normal University
4 shared publications - Junru Ma
Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan, China
3 shared publications
Latest Publications
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3848-3861
New Constructions of Non-GRS MDS Codes, Recovery and Determination Algorithms for GRS Codes
In this paper, we propose a new method for constructing a class of non-GRS MDS codes. The lengths of these codes can reach up to $\frac {q+3}{2}$ (for finite fields of odd characteristic) and $\frac {q+4}{2}$ (for even characteristic), respectively. Owing to their special structure, we can use the Cauchy matrix method to obtain the necessary and sufficient conditions for these codes to be MDS codes and non-GRS MDS codes. Additionally, the inequivalence between these codes and twisted GRS codes is analyzed. Furthermore, we analyze the relationships among several existing classes of codes used for constructing non-GRS MDS codes, propose explicit constructions, and discuss the lengths of non-GRS MDS codes based on these constructions. Finally, we design two efficient algorithms to address two main problems in GRS code research, i.e., determining whether an unknown code $C$ is a GRS code from its generator matrix $G$ , and recovering the key vectors $\boldsymbol {\alpha }$ and $\boldsymbol {v}$ such that $C = \text {GRS}_{n,k}(\boldsymbol {\alpha }, \boldsymbol {v})$ if $C$ is indeed a GRS code. A computational complexity comparison of the proposed algorithms ( $O(nk+n)$ ) with that of the Sidelnikov-Shestakov attack (exceeding $O(qk^{2}n+qk^{3})$ ) shows that our methods offer superior computational efficiency.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3848-3861
New Constructions of Non-GRS MDS Codes, Recovery and Determination Algorithms for GRS Codes
In this paper, we propose a new method for constructing a class of non-GRS MDS codes. The lengths of these codes can reach up to $\frac {q+3}{2}$ (for finite fields of odd characteristic) and $\frac {q+4}{2}$ (for even characteristic), respectively. Owing to their special structure, we can use the Cauchy matrix method to obtain the necessary and sufficient conditions for these codes to be MDS codes and non-GRS MDS codes. Additionally, the inequivalence between these codes and twisted GRS codes is analyzed. Furthermore, we analyze the relationships among several existing classes of codes used for constructing non-GRS MDS codes, propose explicit constructions, and discuss the lengths of non-GRS MDS codes based on these constructions. Finally, we design two efficient algorithms to address two main problems in GRS code research, i.e., determining whether an unknown code $C$ is a GRS code from its generator matrix $G$ , and recovering the key vectors $\boldsymbol {\alpha }$ and $\boldsymbol {v}$ such that $C = \text {GRS}_{n,k}(\boldsymbol {\alpha }, \boldsymbol {v})$ if $C$ is indeed a GRS code. A computational complexity comparison of the proposed algorithms ( $O(nk+n)$ ) with that of the Sidelnikov-Shestakov attack (exceeding $O(qk^{2}n+qk^{3})$ ) shows that our methods offer superior computational efficiency.
- 26 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Column Twisted Reed-Solomon Codes as MDS Codes
In this paper, we study column twisted Reed-Solomon(TRS) codes. We establish some sufficient conditions for these codes to be MDS and show that the dimension of their Schur square codes is 2k. Consequently, these TRS codes are shown to be not equivalent to Reed-Solomon(RS) codes. Moreover, our construction offers more flexible parameters than existing twisted generalized Reed-Solomon(TGRS) code designs. For a large odd prime power q, systematically constructed TGRS codes are known to be limited to length q+1/2 . By contrast, our column TRS construction supports code lengths up to q+3/2 . Finally, we present the dual codes of column TRS codes. Overall, this work introduces a new method for constructing MDS codes by appending column vectors to some generator matrix of an RS code.
- 26 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Column Twisted Reed-Solomon Codes as MDS Codes
In this paper, we study column twisted Reed-Solomon(TRS) codes. We establish some sufficient conditions for these codes to be MDS and show that the dimension of their Schur square codes is 2k. Consequently, these TRS codes are shown to be not equivalent to Reed-Solomon(RS) codes. Moreover, our construction offers more flexible parameters than existing twisted generalized Reed-Solomon(TGRS) code designs. For a large odd prime power q, systematically constructed TGRS codes are known to be limited to length q+1/2 . By contrast, our column TRS construction supports code lengths up to q+3/2 . Finally, we present the dual codes of column TRS codes. Overall, this work introduces a new method for constructing MDS codes by appending column vectors to some generator matrix of an RS code.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
Non Reed-Solomon Type MDS Codes from Elliptic Curves
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
Non Reed-Solomon Type MDS Codes from Elliptic Curves
- 30 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (10) , 7688-7698
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes
In this paper, firstly, we study decoding of a general class of twisted generalized Reed-Solomon (TGRS) codes and provide a precise characterization of the key equation for TGRS codes and propose a decoding algorithm. Secondly, we further study decoding of almost-MDS TGRS codes and provide a decoding algorithm. These two decoding algorithms are more efficient in terms of performance compared with the decoding algorithms presented in [Sun et al., IEEE-TIT, 2024] and [Sui et al., IEEE-TIT, 2023] respectively. Moreover, these two optimized decoding algorithms can be applied to the decoding of a more general class of twisted Goppa codes.
- 30 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (10) , 7688-7698
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes
In this paper, firstly, we study decoding of a general class of twisted generalized Reed-Solomon (TGRS) codes and provide a precise characterization of the key equation for TGRS codes and propose a decoding algorithm. Secondly, we further study decoding of almost-MDS TGRS codes and provide a decoding algorithm. These two decoding algorithms are more efficient in terms of performance compared with the decoding algorithms presented in [Sun et al., IEEE-TIT, 2024] and [Sui et al., IEEE-TIT, 2023] respectively. Moreover, these two optimized decoding algorithms can be applied to the decoding of a more general class of twisted Goppa codes.
- Open Access
Differential Spectrum and Boomerang Spectrum of Some Power Mapping
Let $f(x)=x^{s(p^m-1)}$ be a power mapping over $\mathbb{F}_{p^n}$, where $n=2m$ and $\gcd(s,p^m+1)=t$. In \cite{kpm-1}, Hu et al. determined the differential spectrum and boomerang spectrum of the power function $f$, where $t=1$. So what happens if $t\geq1$? In this paper, we extend the result of \cite{kpm-1} from $t=1$ to general case. We use a different method than in \cite{kpm-1} to determine the differential spectrum and boomerang spectrum of $f$ by studying the number of rational points on some curves. This method may be helpful for calculating the differential spectrum and boomerang spectrum of some Niho type power functions.Open AccessDifferential Spectrum and Boomerang Spectrum of Some Power Mapping
Let $f(x)=x^{s(p^m-1)}$ be a power mapping over $\mathbb{F}_{p^n}$, where $n=2m$ and $\gcd(s,p^m+1)=t$. In \cite{kpm-1}, Hu et al. determined the differential spectrum and boomerang spectrum of the power function $f$, where $t=1$. So what happens if $t\geq1$? In this paper, we extend the result of \cite{kpm-1} from $t=1$ to general case. We use a different method than in \cite{kpm-1} to determine the differential spectrum and boomerang spectrum of $f$ by studying the number of rational points on some curves. This method may be helpful for calculating the differential spectrum and boomerang spectrum of some Niho type power functions. - 5 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-17
Differential uniformity and constacyclic code from some power mapping
- 5 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-17
Differential uniformity and constacyclic code from some power mapping
- Open Access
Differential uniformity and costacyclic code from some power mapping
In this paper, we study the differential properties of $x^d$ over $\mathbb{F}_{p^n}$ with $d=p^{2l}-p^{l}+1$. By studying the differential equation of $x^d$ and the number of rational points on some curves over finite fields, we completely determine differential spectrum of $x^{d}$. Then we investigate the $c$-differential uniformity of $x^{d}$. We also calculate the value distribution of a class of exponential sum related to $x^d$. In addition, we obtain a class of six-weight consta-cyclic codes, whose weight distribution is explicitly determined. Part of our results is a complement of the works shown in [\ref{H1}, \ref{H2}] which mainly focus on cross correlations.Open AccessDifferential uniformity and costacyclic code from some power mapping
In this paper, we study the differential properties of $x^d$ over $\mathbb{F}_{p^n}$ with $d=p^{2l}-p^{l}+1$. By studying the differential equation of $x^d$ and the number of rational points on some curves over finite fields, we completely determine differential spectrum of $x^{d}$. Then we investigate the $c$-differential uniformity of $x^{d}$. We also calculate the value distribution of a class of exponential sum related to $x^d$. In addition, we obtain a class of six-weight consta-cyclic codes, whose weight distribution is explicitly determined. Part of our results is a complement of the works shown in [\ref{H1}, \ref{H2}] which mainly focus on cross correlations. - 14 March 2024
- Published by Springer Nature in Order
- Vol. 42 (1) , 1-23
Constructions of Codes with Weighted Poset Block Metrics
- 14 March 2024
- Published by Springer Nature in Order
- Vol. 42 (1) , 1-23
Constructions of Codes with Weighted Poset Block Metrics
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (2) , 267-282
Nonexistence of some four dimensional linear codes attaining the Griesmer bound
In coding theory, it is important to construct codes with optimal parameters. The codes meeting the Griesmer bound are called Griesmer codes. In this paper, we prove nonexistence of some Griesmer codes of dimension four over finite fields of cardinality eight and nine using projective geometry. Moreover, we improve 24 cases on code lengths for given minimal distance and dimension four. Two precise lower bounds of code lengths have also been determined.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (2) , 267-282
Nonexistence of some four dimensional linear codes attaining the Griesmer bound
In coding theory, it is important to construct codes with optimal parameters. The codes meeting the Griesmer bound are called Griesmer codes. In this paper, we prove nonexistence of some Griesmer codes of dimension four over finite fields of cardinality eight and nine using projective geometry. Moreover, we improve 24 cases on code lengths for given minimal distance and dimension four. Two precise lower bounds of code lengths have also been determined.
- 2 November 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 341-363
Codes with respect to weighted poset block metric
- 2 November 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 341-363
Codes with respect to weighted poset block metric