G. Ge

456 total citations
19 papers, 364 citations indexed

About

G. Ge is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, G. Ge has authored 19 papers receiving a total of 364 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Electrical and Electronic Engineering, 15 papers in Artificial Intelligence and 7 papers in Discrete Mathematics and Combinatorics. Recurrent topics in G. Ge's work include graph theory and CDMA systems (19 papers), Coding theory and cryptography (15 papers) and Finite Group Theory Research (7 papers). G. Ge is often cited by papers focused on graph theory and CDMA systems (19 papers), Coding theory and cryptography (15 papers) and Finite Group Theory Research (7 papers). G. Ge collaborates with scholars based in Canada, China and Australia. G. Ge's co-authors include Jian-Hua Yin, Lei Zhu, Clement Lam, R. Julian R. Abel, Rolf S. Rees, F.E. Bennett, Malcolm Greig, Dianhua Wu and Jennifer Seberry and has published in prestigious journals such as IEEE Transactions on Information Theory, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

G. Ge

19 papers receiving 338 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
G. Ge Canada	10	361	301	113	48	30	19	364
E. R. Lamken United States	13	382 1.1×	242 0.8×	179 1.6×	63 1.3×	15 0.5×	44	412
Tao Feng China	9	279 0.8×	232 0.8×	82 0.7×	45 0.9×	54 1.8×	69	323
Earl S. Kramer United States	11	306 0.8×	244 0.8×	169 1.5×	51 1.1×	14 0.5×	25	324
C.C. Lindner United States	13	582 1.6×	295 1.0×	323 2.9×	183 3.8×	25 0.8×	76	613
Jian-Hua Yin China	10	280 0.8×	228 0.8×	106 0.9×	133 2.8×	46 1.5×	52	388
D. Jungnickel Germany	3	207 0.6×	193 0.6×	120 1.1×	44 0.9×	30 1.0×	4	259
Elizabeth J. Billington Australia	10	309 0.9×	157 0.5×	130 1.2×	172 3.6×	3 0.1×	63	316
Mario Gionfriddo Italy	11	289 0.8×	153 0.5×	164 1.5×	116 2.4×	6 0.2×	67	334
Peter Danziger Canada	9	185 0.5×	99 0.3×	113 1.0×	35 0.7×	9 0.3×	35	221
James C. Beidleman United States	13	263 0.7×	293 1.0×	431 3.8×	38 0.8×	18 0.6×	97	549

Countries citing papers authored by G. Ge

Since Specialization

Citations

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

Fields of papers citing papers by G. Ge

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of G. Ge

This figure shows the co-authorship network connecting the top 25 collaborators of G. Ge. A scholar is included among the top collaborators of G. Ge 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 G. Ge. G. Ge 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:

19 of 19 papers shown

Ge, G. & Clement Lam. (2003). Resolvable group divisible designs with block size four and group size six. Discrete Mathematics. 268(1-3). 139–151. 23 indexed citations

Ge, G. & Clement Lam. (2003). Some new triplewhist tournaments TWh(v). Journal of Combinatorial Theory Series A. 101(1). 153–159. 15 indexed citations

Ge, G. & Clement Lam. (2003). Bhaskar Rao designs with block size four. Discrete Mathematics. 268(1-3). 293–298. 7 indexed citations

Ge, G., Malcolm Greig, & Jennifer Seberry. (2003). Generalized Bhaskar Rao Designs with Block Size 4 Signed over Elementary Abelian Groups. Research Online (University of Wollongong). 8 indexed citations

Ge, G. & Dianhua Wu. (2003). 4‐*GDDs(3ⁿ) and generalized Steiner systems GS(2, 4, v, 3). Journal of Combinatorial Designs. 11(6). 381–393. 8 indexed citations

Abel, R. Julian R., F.E. Bennett, & G. Ge. (2002). Almost resolvable perfect Mendelsohn designs with block size five. Discrete Applied Mathematics. 116(1-2). 1–15. 7 indexed citations

Ge, G., et al.. (2002). Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible. Journal of Combinatorial Theory Series A. 98(2). 357–376. 33 indexed citations

Bennett, F.E., et al.. (2002). Holey Steiner pentagon systems and related designs. Journal of Statistical Planning and Inference. 106(1-2). 353–373. 3 indexed citations

Abel, R. Julian R., F.E. Bennett, & G. Ge. (2002). The Existence of Four HMOLS with Equal Sized Holes. Designs Codes and Cryptography. 26(1-3). 7–31. 11 indexed citations

10.

Abel, R. Julian R., F.E. Bennett, G. Ge, & Lei Zhu. (2002). Existence of Steiner seven-cycle systems. Discrete Mathematics. 252(1-3). 1–16. 8 indexed citations

11.

Abel, R. Julian R., F.E. Bennett, & G. Ge. (2002). Resolvable perfect Mendelsohn designs with block size five. Discrete Mathematics. 247(1-3). 1–12. 5 indexed citations

12.

Ge, G. & R. Julian R. Abel. (2001). Some new HSOLSSOMs of types hⁿ and 1^m u¹. Journal of Combinatorial Designs. 9(6). 435–444. 8 indexed citations

13.

Ge, G.. (2001). Uniform frames with block size four and index one or three. Journal of Combinatorial Designs. 9(1). 28–39. 16 indexed citations

14.

Abel, R. Julian R., et al.. (2001). Resolvable balanced incomplete block designs with block size 5. Journal of Statistical Planning and Inference. 95(1-2). 49–65. 18 indexed citations

15.

Ge, G. & Jian-Hua Yin. (2001). Constructions for optimal (υ, 4, 1) optical orthogonal codes. IEEE Transactions on Information Theory. 47(7). 2998–3004. 85 indexed citations

16.

Wu, Dianhua, G. Ge, & Lei Zhu. (2001). Generalized Steiner systems GS₄ (2, 4, v, g) for g = 2, 3, 6. Journal of Combinatorial Designs. 9(6). 401–423. 5 indexed citations

17.

Ge, G., et al.. (2000). Starters and related codes. Journal of Statistical Planning and Inference. 86(2). 379–395. 71 indexed citations

18.

Ge, G., et al.. (1999). Generalized steiner triple systems with group size five. Journal of Combinatorial Designs. 7(6). 441–453. 24 indexed citations

19.

Ge, G. & Lei Zhu. (1997). Authentication perpendicular arrays APA1(2, 7, ?). Journal of Combinatorial Designs. 5(2). 111–124. 9 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