J. D. Key
Impact in
-
- Finite Group Theory Research
- Artificial Intelligence top 2%
- Coding theory and cryptography
- Quantum Computing Algorithms and Architecture
Papers in
-
- Coding theory and cryptography 64
-
- graph theory and CDMA systems 61
- Advanced Wireless Communication Techniques 6
- Co-authors
- E. F. Assmus (6 shared papers)B. G. Rodrigues (14 shared papers)Jamshid Moori (7 shared papers)Peng Ding (2 shared papers)Ernest E. Shult (1 shared paper)Johannes Siemons (4 shared papers)Peter Dankelmann (2 shared papers)Neil J. Calkin (1 shared paper)
- Journals
- Discrete Mathematics (12 papers)European Journal of Combinatorics (8 papers)Designs Codes and Cryptography (8 papers)Advances in Mathematics of Communications (5 papers)Journal of Combinatorial Theory Series A (3 papers)
- Partner nations
- United StatesSouth AfricaUnited Kingdom
In The Last Decade
J. D. Key
75 papers receiving 604 citations
Peers
Comparison fields: 5 of 39
- Discrete Mathematics and Combinatorics 299
- Artificial Intelligence 592
- Computer Networks and Communications 293
- Electrical and Electronic Engineering 448
- Computational Theory and Mathematics 86
Countries citing papers authored by J. D. Key
This map shows the geographic impact of J. D. Key'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 J. D. Key with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. D. Key more than expected).
Fields of papers citing papers by J. D. Key
This network shows the impact of papers produced by J. D. Key. 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 J. D. Key. The network helps show where J. D. Key may publish in the future.
Co-authors
The 11 scholars most cited alongside J. D. Key, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 77 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1990 | 85 | |
| 2 | 2003 | 37 | |
| 3 | 2005 | 32 | |
| 4 | 2004 | 31 | |
| 5 | 2010 | 20 | |
| 6 | 1984 | 20 | |
| 7 | 1999 | 18 | |
| 8 | 2010 | 18 | |
| 9 | 2000 | 17 | |
| 10 | 1992 | 16 | |
| 11 | 2012 | 14 | |
| 12 | 2011 | 14 | |
| 13 | 2001 | 13 | |
| 14 | Codes and finite geometries | 1993 | 13 |
| 15 | 2012 | 13 | |
| 16 | 2004 | 12 | |
| 17 | 1989 | 12 | |
| 18 | 1998 | 11 | |
| 19 | 1993 | 11 | |
| 20 | 2011 | 11 |
About J. D. Key
J. D. Key is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Computational Theory and Mathematics, having authored 77 papers that have together received 666 indexed citations. Recurring topics across this work include Coding theory and cryptography (64 papers), graph theory and CDMA systems (61 papers), Finite Group Theory Research (37 papers), Cooperative Communication and Network Coding (25 papers), Advanced Wireless Communication Techniques (6 papers), Cellular Automata and Applications (3 papers), Chronic Lymphocytic Leukemia Research (3 papers) and Rings, Modules, and Algebras (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (299 citations), Artificial Intelligence (592 citations), Computer Networks and Communications (293 citations), Electrical and Electronic Engineering (448 citations) and Computational Theory and Mathematics (86 citations). J. D. Key has collaborated with scholars based in United States, South Africa and United Kingdom. Frequent co-authors include E. F. Assmus, B. G. Rodrigues, Jamshid Moori, Peng Ding, Ernest E. Shult, Johannes Siemons, Peter Dankelmann, Neil J. Calkin, Shuhong Gao and W. N. Everitt. Their work appears in journals such as Discrete Mathematics, European Journal of Combinatorics, Designs Codes and Cryptography, Advances in Mathematics of Communications and Journal of Combinatorial Theory Series A.
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.