Tongjiang Yan

479 total citations
56 papers, 239 citations indexed

About

Tongjiang Yan is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Tongjiang Yan has authored 56 papers receiving a total of 239 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Artificial Intelligence, 31 papers in Electrical and Electronic Engineering and 24 papers in Computational Theory and Mathematics. Recurrent topics in Tongjiang Yan's work include Coding theory and cryptography (43 papers), graph theory and CDMA systems (28 papers) and Cellular Automata and Applications (14 papers). Tongjiang Yan is often cited by papers focused on Coding theory and cryptography (43 papers), graph theory and CDMA systems (28 papers) and Cellular Automata and Applications (14 papers). Tongjiang Yan collaborates with scholars based in China, Canada and United States. Tongjiang Yan's co-authors include Xiao Guo-zhen, Qiang Wang, Xiaoni Du, Zhixiong Chen, Yu Li, Xiaoping Li, G Xiao, Li Hong, Chun Wai Ng and Hui Li and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and IEEE Access.

In The Last Decade

Tongjiang Yan

46 papers receiving 224 citations

Peers

Tongjiang Yan

EEE

CTM

CNC

Satyanarayana V. Lokam United States

Patrick Felke Germany

Ariel Gabizon Israel

Zongduo Dai China

Fernando Hernando Spain

Carlos Munuera Spain

Youming Qiao Australia

Dingyi Pei China

Yann Laigle-Chapuy France

Diego Ruano Spain

Satyanarayana V. Lokam United States

Tongjiang Yan

138 ×0.7

67 ×0.4

EEE

193 ×1.6

CTM

11 ×0.5

50 ×2.3

CNC

Citations per year, relative to Tongjiang Yan Tongjiang Yan (= 1×) peers Satyanarayana V. Lokam

Countries citing papers authored by Tongjiang Yan

Since Specialization

Citations

This map shows the geographic impact of Tongjiang Yan'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 Tongjiang Yan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tongjiang Yan more than expected).

Fields of papers citing papers by Tongjiang Yan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tongjiang Yan. 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 Tongjiang Yan. The network helps show where Tongjiang Yan may publish in the future.

Co-authorship network of co-authors of Tongjiang Yan

This figure shows the co-authorship network connecting the top 25 collaborators of Tongjiang Yan. A scholar is included among the top collaborators of Tongjiang Yan 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 Tongjiang Yan. Tongjiang Yan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Yan, Tongjiang, et al.. (2025). DFFL: A dual fairness framework for federated learning. Computer Communications. 235. 108104–108104.

Zhao, Cuijiao, et al.. (2025). Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes. IEEE Transactions on Information Theory. 71(7). 5130–5143. 2 indexed citations

Li, Jialin, et al.. (2024). CosPer: An adaptive personalized approach for enhancing fairness and robustness of federated learning. Information Sciences. 675. 120760–120760. 2 indexed citations

Li, Xiao Peng, et al.. (2023). Robust Low-Rank Matrix Recovery as Mixed Integer Programming via $\ell _{0}$-Norm Optimization. IEEE Signal Processing Letters. 30. 1012–1016. 5 indexed citations

Dai, Qiang, et al.. (2023). FedCSR: A new cluster sampling based on rotation mechanism in horizontal federated learning. Computer Communications. 210. 312–320. 1 indexed citations

Yan, Tongjiang, et al.. (2023). Non-binary quantum synchronizable codes based on cyclic codes over $$\textrm{F}_q$$. Quantum Information Processing. 22(1).

Wang, Xueting, et al.. (2023). New quantum stabilizer codes with better parameters from the images of some RS codes and BCH codes. Quantum Information Processing. 22(1). 1 indexed citations

Yan, Tongjiang, et al.. (2022). On the 1-error linear complexity of two-prime generator. AIMS Mathematics. 7(4). 5821–5829.

Yan, Tongjiang, et al.. (2022). Quantum Synchronizable Codes from Generalized Cyclotomy. 1–5.

10.

Yan, Tongjiang, et al.. (2020). The 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Order 2 and Period pq. IEEE Access. 8. 140682–140687. 3 indexed citations

11.

Yan, Ming, et al.. (2020). Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products. Cryptography and Communications. 13(1). 15–26. 4 indexed citations

12.

Yan, Tongjiang, et al.. (2020). Computing the 2-Adic Complexity of Two Classes Generalized Cyclotomic Sequences. IEEE Access. 8. 140478–140485. 2 indexed citations

13.

Yan, Tongjiang, et al.. (2017). New Constructions of Binary Interleaved Sequences with Low Autocorrelation. International journal of network security. 19(4). 546–550. 2 indexed citations

14.

Ma, Xiao, et al.. (2016). Linear complexity of some binary interleaved sequences of period 4N. International journal of network security. 18(2). 244–249. 1 indexed citations

15.

Li, Zhe, et al.. (2012). Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E95.A(9). 1637–1641.

16.

Yan, Tongjiang. (2010). New Binary Sequences of Period pq with Low Values of Correlation and Large Linear Complexity. International journal of network security. 10(3). 185–189. 3 indexed citations

17.

Du, Xiaoni, et al.. (2010). Linear Complexity of Generalized Cyclotomic Sequences with Period pm. JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY. 32(4). 821–824. 1 indexed citations

18.

Yan, Tongjiang, Xiaoni Du, Shuqing Li, & Xiao Guo-zhen. (2008). Trace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences. International journal of network security. 7. 269–272. 2 indexed citations

19.

Yan, Tongjiang, et al.. (2007). On the linear complexity of generalized cyclotomic sequences with the period pm. Applied Mathematics Letters. 21(2). 187–193. 25 indexed citations

20.

Yan, Tongjiang, et al.. (2007). Cryptographic properties of some binary generalized cyclotomic sequences with the length p2☆. Information Sciences. 178(4). 1078–1086. 8 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