Hongwei Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hongwei Liu has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Bocong Chen
School of Mathematics, South China University of Technology, Guangzhou, China
13 shared publications - Xu Pan
South-Central Minzu University
13 shared publications - Shengwei Liu
School of Mathematics and Statistics, Central China Normal University, Wuhan, China
9 shared publications - Yuqing Fu
School of Mathematics and Statistics Central China Normal University 430079 Wuhan China
8 shared publications - Hao Chen
South-Central Minzu University
6 shared publications Liren Lin
School of Cyber Science and Technology Hubei University 430062 Wuhan China
5 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (10) , 7482-7499
The Complete Weight Enumerators of Linear Codes From Generalized Augmented Codes
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (10) , 7482-7499
The Complete Weight Enumerators of Linear Codes From Generalized Augmented Codes
- 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.
- 25 March 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 113
A class of narrow-sense BCH codes of length q m − 1 λ
- 25 March 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 113
A class of narrow-sense BCH codes of length q m − 1 λ
- Top Cited Papers
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2112-2122
Constructions of Non-Generalized Reed–Solomon MDS Codes
Generalized Reed-Solomon codes form the most prominent class of maximum distance separable (MDS) codes, codes that are optimal in the sense that their minimum distance cannot be improved for a given length and code size. The study of codes that are MDS yet not generalized Reed-Solomon codes, called non-generalized Reed-Solomon MDS codes, started with the work by Roth and Lemple (1989), where the first examples were exhibited. It then gained traction thanks to the work by Beelen et al. (2017), who introduced twisted Reed-Solomon codes, and showed that families of such codes are non-generalized Reed-Solomon MDS codes. Finding non-generalized Reed-Solomon MDS codes is naturally motivated by the classification of MDS codes. In this paper, we provide a generic construction of MDS codes, yielding infinitely many examples. We then explicit families of non-generalized Reed-Solomon MDS codes. Finally we position some of the proposed codes with respect to generalized twisted Reed-Solomon codes, and provide new view points on this family of codes.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2112-2122
Top Cited PapersConstructions of Non-Generalized Reed–Solomon MDS Codes
Generalized Reed-Solomon codes form the most prominent class of maximum distance separable (MDS) codes, codes that are optimal in the sense that their minimum distance cannot be improved for a given length and code size. The study of codes that are MDS yet not generalized Reed-Solomon codes, called non-generalized Reed-Solomon MDS codes, started with the work by Roth and Lemple (1989), where the first examples were exhibited. It then gained traction thanks to the work by Beelen et al. (2017), who introduced twisted Reed-Solomon codes, and showed that families of such codes are non-generalized Reed-Solomon MDS codes. Finding non-generalized Reed-Solomon MDS codes is naturally motivated by the classification of MDS codes. In this paper, we provide a generic construction of MDS codes, yielding infinitely many examples. We then explicit families of non-generalized Reed-Solomon MDS codes. Finally we position some of the proposed codes with respect to generalized twisted Reed-Solomon codes, and provide new view points on this family of codes.
- Top Cited Papers
- 13 January 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 112
Function-correcting codes with homogeneous distance
- 13 January 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 112
Top Cited PapersFunction-correcting codes with homogeneous distance
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
The Power Moments for the Subcode Support Weight Distributions of Linear Codes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
The Power Moments for the Subcode Support Weight Distributions of Linear Codes
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 22, 233-239
How to expand a self-orthogonal code
In this paper, we show how to expand Euclidean/Hermitian self-orthogonal code preserving their orthogonal property. Our results show that every $ k $-dimension Hermitian self-orthogonal code is contained in a $ (k+1) $-dimensional Hermitian self-orthogonal code. Also, for $ k< n/2-1 $, every $ [n,k] $ Euclidean self-orthogonal code is contained in an $ [n,k+1] $ Euclidean self-orthogonal code. Moreover, for $ k = n/2-1 $ and $ p = 2 $, we can also fulfill the expanding process. But, for $ k = n/2-1 $ and $ p $ odd prime, the expanding process can be fulfilled if and only if an extra condition must be satisfied. We also propose two feasible algorithms on these expanding procedures.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 22, 233-239
How to expand a self-orthogonal code
In this paper, we show how to expand Euclidean/Hermitian self-orthogonal code preserving their orthogonal property. Our results show that every $ k $-dimension Hermitian self-orthogonal code is contained in a $ (k+1) $-dimensional Hermitian self-orthogonal code. Also, for $ k< n/2-1 $, every $ [n,k] $ Euclidean self-orthogonal code is contained in an $ [n,k+1] $ Euclidean self-orthogonal code. Moreover, for $ k = n/2-1 $ and $ p = 2 $, we can also fulfill the expanding process. But, for $ k = n/2-1 $ and $ p $ odd prime, the expanding process can be fulfilled if and only if an extra condition must be satisfied. We also propose two feasible algorithms on these expanding procedures.- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2162-2176
The t -Designs and the Subcode Support Weight Distributions of r -GMDS Codes
The Assmus-Mattson Theorem is a famous and effective way to construct$t$ -designs from supports of codewords of a linear code. By extending this idea, we study the$t$ -designs constructed from supports of subcodes of linear codes. In this paper, we introduce the notion of$r$ -generalized maximum distance separable codes ($r$ -GMDS codes) and determine the$t$ -designs constructed from supports of subcodes of a$r$ -GMDS code. Also, we show that$ t $ -designs can be constructed from supports of subcodes of a linear code if the automorphism group of this linear code is$ t $ -transitive. In particular, we prove that$t$ -designs can be constructed from supports of subcodes of Reed-Muller codes. Then we show that the number of blocks in the$ t $ -design constructed from supports of subcodes of a linear code is related to the subcode support weight distributions of this linear code. Next, we provide some new formulas for the subcode support weight distributions of$r$ -GMDS codes. After we present a connection between$l$ -MDS codes and$r$ -GMDS codes, some new formulas are obtained for the subcode support weight distributions of$l$ -MDS codes. In particular, we completely determine the subcode support weight distributions of maximum distance separable (MDS) codes and near maximum distance separable (NMDS) codes. As an example, the subcode support weight distributions of the extended ternary Golay code are completely determined.- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2162-2176
The t -Designs and the Subcode Support Weight Distributions of r -GMDS Codes
The Assmus-Mattson Theorem is a famous and effective way to construct$t$ -designs from supports of codewords of a linear code. By extending this idea, we study the$t$ -designs constructed from supports of subcodes of linear codes. In this paper, we introduce the notion of$r$ -generalized maximum distance separable codes ($r$ -GMDS codes) and determine the$t$ -designs constructed from supports of subcodes of a$r$ -GMDS code. Also, we show that$ t $ -designs can be constructed from supports of subcodes of a linear code if the automorphism group of this linear code is$ t $ -transitive. In particular, we prove that$t$ -designs can be constructed from supports of subcodes of Reed-Muller codes. Then we show that the number of blocks in the$ t $ -design constructed from supports of subcodes of a linear code is related to the subcode support weight distributions of this linear code. Next, we provide some new formulas for the subcode support weight distributions of$r$ -GMDS codes. After we present a connection between$l$ -MDS codes and$r$ -GMDS codes, some new formulas are obtained for the subcode support weight distributions of$l$ -MDS codes. In particular, we completely determine the subcode support weight distributions of maximum distance separable (MDS) codes and near maximum distance separable (NMDS) codes. As an example, the subcode support weight distributions of the extended ternary Golay code are completely determined.- 24 December 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 14
Optimal CIS codes, optimal t-CIS codes and their applications in cryptography
- 24 December 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 14
Optimal CIS codes, optimal t-CIS codes and their applications in cryptography
- Open Access
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 $\bmα$ and $\bm{v}$ such that $C = \GRS_{n,k}(\bmα, \bm{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^2n+qk^3)$) shows that our methods offer superior computational efficiency.Open AccessNew 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 $\bmα$ and $\bm{v}$ such that $C = \GRS_{n,k}(\bmα, \bm{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^2n+qk^3)$) shows that our methods offer superior computational efficiency.