FFFang-Wei Fu
Fang-Wei Fu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fang-Wei Fu has a total of 143 co-authors. Here are the top co-authors by number of shared publications:
- Jian Gao
School of Mathematics and Statistics, Shandong University of Technology, Zibo, China
24 shared publications - Weijun Fang
Shandong University
24 shared publications - Shu-Tao Xia
Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, China
22 shared publications - Yonglin Cao
School of Mathematics and Statistics, Shandong University of Technology, Zibo, Shandong 255091, China
20 shared publications - Yuan Cao
Shandong Univ Technol, Sch Math & Stat, Zibo 255091, Shandong, Peoples R China
17 shared publications - Jiaxin Wang
School of Mathematics, Hefei University of Technology, Hefei, China
15 shared publications
Latest Publications
- Open Access
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 27
On twisted Gabidulin codes with $ \ell $ twistsTwisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study a class of twisted Gabidulin codes with $ \ell $ twists. Specifically, we first establish necessary and sufficient conditions for them to be maximum rank distance (MRD) codes and construct a new class of MRD codes. Then we also present the necessary conditions for these twisted Gabidulin codes to be MRD codes. Finally, we investigate their inequivalence, as well as their covering radii and deep holes.- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 27
Open AccessOn twisted Gabidulin codes with $ \ell $ twistsTwisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study a class of twisted Gabidulin codes with $ \ell $ twists. Specifically, we first establish necessary and sufficient conditions for them to be maximum rank distance (MRD) codes and construct a new class of MRD codes. Then we also present the necessary conditions for these twisted Gabidulin codes to be MRD codes. Finally, we investigate their inequivalence, as well as their covering radii and deep holes. - 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 4802-4827
Sequence Reconstruction Problem for Ternary Deletion Channels
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 4802-4827
Sequence Reconstruction Problem for Ternary Deletion Channels
- 5 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 2753-2768
Cyclic Codes With Even Length From the (C 1 + C 2 ,C 1 – C 2 ) Construction
Few-weight cyclic codes are widely used in the area of communication and cryptography due to their good algebraic structure. Let${\mathcal {C}}_{1}$ be an$[n,s_{1},d_{1}]_{q}$ cyclic code and${\mathcal {C}}_{2}$ be an$[n,s_{2},d_{2}]_{q}$ negacyclic code. Define$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})=\{(c_{1}+c_{2},c_{1}-c_{2})|c_{1}\in {\mathcal {C}}_{1},c_{2}\in {\mathcal {C}}_{2}\}$ . Notice that$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ is a$[2n,k\leq s_{1}+s_{2}]_{q}$ cyclic code. In this paper, based on some structural properties of$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ , we determine the weight distributions of$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ in some special cases by Gauss sums. Several classes of distance-optimal or almost distance-optimal few-weight cyclic codes with respect to the Griesmer bound are derived. Furthermore, by some puncturing and shortening techniques on the cyclic code$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ , we derive six classes of distance-optimal or almost distance-optimal linear codes. At the end, we construct some explicit distance-optimal or best known few-weight cyclic codes with even length. As an application, we determine the locality of punctured and shortened codes, and obtained several families of distance-optimal or dimension-optimal locally recoverable codes.- 5 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 2753-2768
Cyclic Codes With Even Length From the (C 1 + C 2 ,C 1 – C 2 ) Construction
Few-weight cyclic codes are widely used in the area of communication and cryptography due to their good algebraic structure. Let${\mathcal {C}}_{1}$ be an$[n,s_{1},d_{1}]_{q}$ cyclic code and${\mathcal {C}}_{2}$ be an$[n,s_{2},d_{2}]_{q}$ negacyclic code. Define$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})=\{(c_{1}+c_{2},c_{1}-c_{2})|c_{1}\in {\mathcal {C}}_{1},c_{2}\in {\mathcal {C}}_{2}\}$ . Notice that$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ is a$[2n,k\leq s_{1}+s_{2}]_{q}$ cyclic code. In this paper, based on some structural properties of$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ , we determine the weight distributions of$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ in some special cases by Gauss sums. Several classes of distance-optimal or almost distance-optimal few-weight cyclic codes with respect to the Griesmer bound are derived. Furthermore, by some puncturing and shortening techniques on the cyclic code$({\mathcal {C}}_{1}+{\mathcal {C}}_{2},{\mathcal {C}}_{1}-{\mathcal {C}}_{2})$ , we derive six classes of distance-optimal or almost distance-optimal linear codes. At the end, we construct some explicit distance-optimal or best known few-weight cyclic codes with even length. As an application, we determine the locality of punctured and shortened codes, and obtained several families of distance-optimal or dimension-optimal locally recoverable codes.- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 3447-3459
Further Results on Bent Partitions
Bent partitions of$V_{n}^{(p)}$ play an important role in constructing (vectorial) bent functions, partial difference sets, and association schemes, where$V_{n}^{(p)}$ denotes an$n$ -dimensional vector space over the finite field$\mathbb {F}_{p}$ ,$n$ is an even positive integer, and$p$ is a prime. It is a challenging open problem whether the depth of any bent partition of$V_{n}^{(p)}$ is always a power of$p$ . Notably, the depths of all currently known bent partitions of$V_{n}^{(p)}$ are powers of$p$ . In this paper, we prove that for a bent partition$\Gamma $ of$V_{n}^{(p)}$ for which all the$p$ -ary bent functions generated by$\Gamma $ are regular or all are weakly regular but not regular, the depth of$\Gamma $ must be a power of$p$ . We present new constructions of bent partitions that (do not) correspond to vectorial dual-bent functions. In particular, a new construction of vectorial dual-bent functions is provided. Additionally, for general bent partitions of$V_{n}^{(2)}$ , we establish a characterization in terms of Hadamard matrices.- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 3447-3459
Further Results on Bent Partitions
Bent partitions of$V_{n}^{(p)}$ play an important role in constructing (vectorial) bent functions, partial difference sets, and association schemes, where$V_{n}^{(p)}$ denotes an$n$ -dimensional vector space over the finite field$\mathbb {F}_{p}$ ,$n$ is an even positive integer, and$p$ is a prime. It is a challenging open problem whether the depth of any bent partition of$V_{n}^{(p)}$ is always a power of$p$ . Notably, the depths of all currently known bent partitions of$V_{n}^{(p)}$ are powers of$p$ . In this paper, we prove that for a bent partition$\Gamma $ of$V_{n}^{(p)}$ for which all the$p$ -ary bent functions generated by$\Gamma $ are regular or all are weakly regular but not regular, the depth of$\Gamma $ must be a power of$p$ . We present new constructions of bent partitions that (do not) correspond to vectorial dual-bent functions. In particular, a new construction of vectorial dual-bent functions is provided. Additionally, for general bent partitions of$V_{n}^{(2)}$ , we establish a characterization in terms of Hadamard matrices.- 24 February 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (3) , 61
Learning with errors over group rings constructed by semi-direct product
- 24 February 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (3) , 61
Learning with errors over group rings constructed by semi-direct product
- 18 February 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (3) , 52
Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
- 18 February 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (3) , 52
Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
- Open Access
Extended Gabidulin-Kronecker Product Codes and Their Application to Cryptosystems
In this paper, we initiate the study of Extended Gabidulin codes with a Kronecker product structure and propose three enhanced variants of the Rank Quasi-Cyclic (RQC) (Melchor et.al., IEEE IT, 2018) cryptosystem. First, we establish precise bounds on the minimum rank distance of Gabidulin-Kronecker product codes under two distinct parameter regimes. Specifically, when $n_{1}=k_{1}$ and $n_{2}=m<n_{1}n_{2}$, the minimum rank distance is exactly $n_{2}-k_{2}+1$. This yields a new family of Maximum Rank Distance (MRD) codes, which are distinct from classical Gabidulin codes. For the case of $k_{1}\leq n_{1},k_{2}\leq n_{2},n_{1}n_{2}\leq m$, the minimum rank distance $d$ of Gabidulin-Kronecker product codes satisfies a tight upper and lower bound, i.e., $n_{2}-k_{2}+1 \leq d \leq (n_{1}-k_{1}+1)(n_{2}-k_{2}+1)$. Second, we introduce a new class of decodable rank-metric codes, namely Extended Gabidulin-Kronecker product (EGK) codes, which generalize the structure of Gabidulin-Kronecker product (GK) codes. We also propose a decoding algorithm that directly retrieves the codeword without recovering the error vector, thus improving efficiency. This algorithm achieves zero decoding failure probability when the error weight is within its correction capability. Third, we propose three enhanced variants of the RQC cryptosystem based on EGK codes, each offering a distinct trade-off between security and efficiency. For 128-bit security, all variants achieve significant reductions in public key size compared to the Multi-UR-AG (Bidoux et.al., IEEE IT, 2024) while ensuring zero decryption failure probability--a key security advantage over many existing rank-based schemes.Open AccessExtended Gabidulin-Kronecker Product Codes and Their Application to Cryptosystems
In this paper, we initiate the study of Extended Gabidulin codes with a Kronecker product structure and propose three enhanced variants of the Rank Quasi-Cyclic (RQC) (Melchor et.al., IEEE IT, 2018) cryptosystem. First, we establish precise bounds on the minimum rank distance of Gabidulin-Kronecker product codes under two distinct parameter regimes. Specifically, when $n_{1}=k_{1}$ and $n_{2}=m<n_{1}n_{2}$, the minimum rank distance is exactly $n_{2}-k_{2}+1$. This yields a new family of Maximum Rank Distance (MRD) codes, which are distinct from classical Gabidulin codes. For the case of $k_{1}\leq n_{1},k_{2}\leq n_{2},n_{1}n_{2}\leq m$, the minimum rank distance $d$ of Gabidulin-Kronecker product codes satisfies a tight upper and lower bound, i.e., $n_{2}-k_{2}+1 \leq d \leq (n_{1}-k_{1}+1)(n_{2}-k_{2}+1)$. Second, we introduce a new class of decodable rank-metric codes, namely Extended Gabidulin-Kronecker product (EGK) codes, which generalize the structure of Gabidulin-Kronecker product (GK) codes. We also propose a decoding algorithm that directly retrieves the codeword without recovering the error vector, thus improving efficiency. This algorithm achieves zero decoding failure probability when the error weight is within its correction capability. Third, we propose three enhanced variants of the RQC cryptosystem based on EGK codes, each offering a distinct trade-off between security and efficiency. For 128-bit security, all variants achieve significant reductions in public key size compared to the Multi-UR-AG (Bidoux et.al., IEEE IT, 2024) while ensuring zero decryption failure probability--a key security advantage over many existing rank-based schemes. - 8 January 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 25
Weight distributions of two classes of optimal $(r{,}\delta )$-locally repairable codes- 8 January 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 25
Weight distributions of two classes of optimal $(r{,}\delta )$-locally repairable codes