Yanxun Chang

1.8k total citations
165 papers, 1.2k citations indexed

About

Yanxun Chang is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Yanxun Chang has authored 165 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 147 papers in Electrical and Electronic Engineering, 107 papers in Artificial Intelligence and 58 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Yanxun Chang's work include graph theory and CDMA systems (140 papers), Coding theory and cryptography (99 papers) and Finite Group Theory Research (45 papers). Yanxun Chang is often cited by papers focused on graph theory and CDMA systems (140 papers), Coding theory and cryptography (99 papers) and Finite Group Theory Research (45 papers). Yanxun Chang collaborates with scholars based in China, Italy and United States. Yanxun Chang's co-authors include Ying Miao, Tao Feng, Lijun Ji, Xiaomiao Wang, Giovanni Lo Faro, Ryoh Fuji‐Hara, Jianxing Yin, M.E. Marhic, Cunsheng Ding and Gennian Ge and has published in prestigious journals such as IEEE Transactions on Information Theory, Information Sciences and Journal of Lightwave Technology.

In The Last Decade

Yanxun Chang

140 papers receiving 1.1k citations

Peers

Yanxun Chang
Vladimir D. Tonchev United States
C. A. Rodger United States
Kevin T. Phelps United States
C.C. Lindner United States
D. G. Hoffman United States
Yanxun Chang
Citations per year, relative to Yanxun Chang Yanxun Chang (= 1×) peers Marco Buratti

Countries citing papers authored by Yanxun Chang

Since Specialization
Citations

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

Fields of papers citing papers by Yanxun Chang

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yanxun Chang

This figure shows the co-authorship network connecting the top 25 collaborators of Yanxun Chang. A scholar is included among the top collaborators of Yanxun Chang 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 Yanxun Chang. Yanxun Chang 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.
Zhang, Zian, Yanxun Chang, & Tao Feng. (2025). Cyclic balanced sampling plans avoiding adjacent units with block size four. Discrete Mathematics. 348(7). 114490–114490.
2.
Chang, Yanxun, et al.. (2022). New Constructions of D2D Placement Delivery Arrays. IEEE Communications Letters. 27(1). 85–89. 2 indexed citations
3.
Chang, Yanxun, et al.. (2021). Placement Delivery Arrays Based on Combinatorial Designs. IEEE Communications Letters. 26(2). 296–300. 6 indexed citations
4.
Chang, Yanxun, et al.. (2011). The existence spectrum for (3,λ)-GDDs of type gtu1. Discrete Mathematics. 312(2). 341–350.
5.
Wang, Xiaomiao, Yanxun Chang, & Ruizhong Wei. (2011). Existence of cyclic (3,λ)-GDD of type gv having prescribed number of short orbits. Discrete Mathematics. 311(8-9). 663–675.
6.
Chang, Yanxun, et al.. (2011). The fine triangle intersection problem for kite systems. Discrete Mathematics. 312(3). 545–553. 9 indexed citations
7.
Chang, Yanxun, et al.. (2010). Large sets of resolvable idempotent Latin squares. Discrete Mathematics. 311(1). 24–31. 4 indexed citations
8.
Chang, Yanxun, et al.. (2010). The triangle intersection numbers of a pair of disjoint S(2,4,v)s. Discrete Mathematics. 310(21). 3007–3017. 5 indexed citations
9.
Chang, Yanxun, Tao Feng, & Giovanni Lo Faro. (2009). The triangle intersection problem for S(2,4,v) designs. Discrete Mathematics. 310(22). 3194–3205. 8 indexed citations
10.
Wang, Zhao & Yanxun Chang. (2008). Further results on fine structures of three Latin squares.. Australas. J Comb.. 42. 241–252.
11.
Chang, Yanxun, et al.. (2005). Product constructions for large sets of resolvable MTSs and DTSs.. Australas. J Comb.. 33. 47–56. 4 indexed citations
12.
Li, Q. & Yanxun Chang. (2004). Decomposition of lambda-fold complete graphs into a certain five-vertex graph.. Australas. J Comb.. 30. 175–182. 2 indexed citations
13.
Bryant, Darryn, Yanxun Chang, C. A. Rodger, & Ruizhong Wei. (2002). TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS. Communication in Statistics- Theory and Methods. 31(8). 1441–1455. 22 indexed citations
14.
Chang, Yanxun & Giovanni Lo Faro. (2002). Intersection numbers of Latin squares with their own orthogonal mates.. Australas. J Comb.. 26. 283–304. 4 indexed citations
15.
Chang, Yanxun. (2002). The spectra for two classes of graph designs.. Ars Combinatoria. 65. 4 indexed citations
16.
Chang, Yanxun. (2000). The existence of resolvable BIBD with k even and λ=1. Discrete Mathematics. 218(1-3). 9–23. 3 indexed citations
17.
Chang, Yanxun & Gennian Ge. (1999). Some new large sets of KTS(v).. Ars Combinatoria. 51. 122–128. 13 indexed citations
18.
Chang, Yanxun & Giovanni Lo Faro. (1999). Intersection Numbers of Kirkman Triple Systems. Journal of Combinatorial Theory Series A. 86(2). 348–361. 13 indexed citations
19.
Chang, Yanxun, et al.. (1996). The spectrum of self-converse MTS.. Ars Combinatoria. 44. 2 indexed citations
20.
Chang, Yanxun. (1992). ON LARGE SETS OF PAIRWISE DISJOINT TRANSITIVE TRIPLE SYSTEMS. 科学通报(英文版). 1 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