Fang‐Wei Fu

3.2k total citations
232 papers, 1.9k citations indexed

About

Fang‐Wei Fu is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Fang‐Wei Fu has authored 232 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 184 papers in Artificial Intelligence, 137 papers in Electrical and Electronic Engineering and 100 papers in Computer Networks and Communications. Recurrent topics in Fang‐Wei Fu's work include Coding theory and cryptography (174 papers), graph theory and CDMA systems (107 papers) and Cooperative Communication and Network Coding (56 papers). Fang‐Wei Fu is often cited by papers focused on Coding theory and cryptography (174 papers), graph theory and CDMA systems (107 papers) and Cooperative Communication and Network Coding (56 papers). Fang‐Wei Fu collaborates with scholars based in China, France and Singapore. Fang‐Wei Fu's co-authors include Jian Gao, Weijun Fang, Shu‐Tao Xia, A. J. Han Vinck, Bin Chen, Victor K. Wei, Torleiv Kløve, Raymond W. Yeung, Yonglin Cao and Jie Hao and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Communications and Applied Mathematics and Computation.

In The Last Decade

Fang‐Wei Fu

203 papers receiving 1.9k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Fang‐Wei Fu China 25 1.5k 988 846 690 187 232 1.9k
Deng Tang China 16 741 0.5× 501 0.5× 626 0.7× 308 0.4× 30 0.2× 63 1.3k
Udaya Parampalli Australia 19 955 0.7× 985 1.0× 677 0.8× 227 0.3× 144 0.8× 116 1.4k
J. Justesen Denmark 17 671 0.5× 436 0.4× 341 0.4× 348 0.5× 46 0.2× 46 874
J. J. Stiffler United States 9 824 0.6× 966 1.0× 668 0.8× 320 0.5× 74 0.4× 22 1.5k
T.R.N. Rao United States 17 749 0.5× 765 0.8× 381 0.5× 263 0.4× 46 0.2× 65 1.3k
Shu Lin United States 17 837 0.6× 1.5k 1.5× 1.6k 1.9× 230 0.3× 26 0.1× 37 1.9k
Shuxing Li China 14 484 0.3× 389 0.4× 198 0.2× 165 0.2× 68 0.4× 40 719
A. J. Han Vinck Germany 22 436 0.3× 2.0k 2.0× 765 0.9× 236 0.3× 25 0.1× 158 2.3k
Mario Blaum United States 23 1.1k 0.7× 640 0.6× 2.0k 2.3× 613 0.9× 53 0.3× 92 2.5k
Y. Be'ery Israel 16 832 0.6× 825 0.8× 694 0.8× 143 0.2× 23 0.1× 58 1.2k

Countries citing papers authored by Fang‐Wei Fu

Since Specialization
Citations

This map shows the geographic impact of Fang‐Wei Fu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Fang‐Wei Fu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fang‐Wei Fu more than expected).

Fields of papers citing papers by Fang‐Wei Fu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fang‐Wei Fu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Fang‐Wei Fu. The network helps show where Fang‐Wei Fu may publish in the future.

Co-authorship network of co-authors of Fang‐Wei Fu

This figure shows the co-authorship network connecting the top 25 collaborators of Fang‐Wei Fu. A scholar is included among the top collaborators of Fang‐Wei Fu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Fang‐Wei Fu. Fang‐Wei Fu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Liu, Jian, et al.. (2024). Constructions of rotation symmetric Boolean functions satisfying almost all cryptographic criteria. Theoretical Computer Science. 1020. 114869–114869. 1 indexed citations
2.
Meng, Xiangrui, Jian Gao, & Fang‐Wei Fu. (2024). Weight distribution of double cyclic codes over Fq+uFq. Finite Fields and Their Applications. 95. 102389–102389. 2 indexed citations
3.
Fu, Fang‐Wei, et al.. (2024). A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes. Theoretical Computer Science. 994. 114480–114480. 1 indexed citations
4.
Fang, Weijun, et al.. (2024). New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes. IEEE Transactions on Information Theory. 70(7). 4968–4982.
5.
Fang, Weijun, et al.. (2024). Bounds and Constructions of Singleton-Optimal Locally Repairable Codes With Small Localities. IEEE Transactions on Information Theory. 70(10). 6842–6856.
6.
Fang, Weijun, et al.. (2024). Some New Results on Improved Bounds and Constructions of Singleton-Optimal (r,δ) Locally Repairable Codes. IEEE Transactions on Communications. 73(5). 2876–2890.
7.
Gao, Jian, Yaozong Zhang, Xiangrui Meng, & Fang‐Wei Fu. (2023). Minimal linear codes from defining sets over F p + u F p . Discrete Mathematics. 346(10). 113584–113584. 4 indexed citations
8.
Fu, Fang‐Wei, et al.. (2023). Constructions of linear codes with two or three weights from vectorial dual-bent functions. Discrete Mathematics. 346(8). 113448–113448. 3 indexed citations
9.
Fang, Weijun, et al.. (2023). Quantum MDS codes with new length and large minimum distance. Discrete Mathematics. 347(1). 113662–113662. 2 indexed citations
10.
Fang, Weijun, Fang‐Wei Fu, Bin Chen, & Shu‐Tao Xia. (2023). Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes. Finite Fields and Their Applications. 91. 102273–102273. 1 indexed citations
11.
Fang, Weijun, et al.. (2022). Linear ℓ-intersection pairs of MDS codes and their applications to AEAQECCs. Cryptography and Communications. 14(5). 1189–1206. 3 indexed citations
12.
Hao, Jie, Jun Zhang, Shu‐Tao Xia, Fang‐Wei Fu, & Yixian Yang. (2022). Constructions and Weight Distributions of Optimal Locally Repairable Codes. IEEE Transactions on Communications. 70(5). 2895–2908. 2 indexed citations
13.
Hao, Jie, Shu‐Tao Xia, Kenneth W. Shum, et al.. (2020). Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach. IEEE Transactions on Information Theory. 66(12). 7465–7474. 32 indexed citations
14.
Yeung, Raymond W., et al.. (2020). Local-Encoding-Preserving Secure Network Coding. IEEE Transactions on Information Theory. 66(10). 5965–5994. 5 indexed citations
15.
Chen, Bin, Weijun Fang, Shu‐Tao Xia, Jie Hao, & Fang‐Wei Fu. (2020). Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6. IEEE Transactions on Information Theory. 67(1). 217–231. 30 indexed citations
16.
Chen, Bin, Weijun Fang, Shu‐Tao Xia, & Fang‐Wei Fu. (2019). Constructions of Optimal $(r,\delta)$ Locally Repairable Codes via Constacyclic Codes. IEEE Transactions on Communications. 67(8). 5253–5263. 34 indexed citations
17.
Fang, Weijun & Fang‐Wei Fu. (2019). Some New Constructions of Quantum MDS Codes. IEEE Transactions on Information Theory. 65(12). 7840–7847. 36 indexed citations
18.
Fang, Weijun & Fang‐Wei Fu. (2019). New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes. IEEE Transactions on Information Theory. 65(9). 5574–5579. 36 indexed citations
19.
Cao, Yuan, et al.. (2017). Left dihedral codes over Galois rings GR(p2,m). Discrete Mathematics. 341(6). 1816–1834. 7 indexed citations
20.
Chen, Bin, Shu‐Tao Xia, Jie Hao, & Fang‐Wei Fu. (2017). Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes. IEEE Transactions on Information Theory. 64(4). 2499–2511. 64 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026