J. F. Dillon
- Artificial Intelligence top 5%
- Electrical and Electronic Engineering
- Discrete Mathematics and Combinatorics top 5%
- Computational Theory and Mathematics top 10%
- Computer Networks and Communications
- Co-authors
- Hans DobbertinDavid P. RoselleK. T. ArasuDieter JungnickelAlexander PottGary McGuireKa Hin LeungSiu Lun
- Topics
- graph theory and CDMA systems (12 papers)Coding theory and cryptography (11 papers)Finite Group Theory Research (5 papers)
- Journals
- IEEE Transactions on Information TheorySIAM Journal on Applied MathematicsDuke Mathematical Journal
- Partner nations
- United StatesGermanySingapore
In The Last Decade
J. F. Dillon
16 papers receiving 354 citations
Peers
Comparison fields: 5 of 49
- Artificial Intelligence 277
- Electrical and Electronic Engineering 260
- Discrete Mathematics and Combinatorics 100
- Computational Theory and Mathematics 61
- Computer Networks and Communications 41
Countries citing papers authored by J. F. Dillon
This map shows the geographic impact of J. F. Dillon'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. F. Dillon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. F. Dillon more than expected).
Fields of papers citing papers by J. F. Dillon
This network shows the impact of papers produced by J. F. Dillon. 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. F. Dillon. The network helps show where J. F. Dillon may publish in the future.
Co-authorship network of co-authors of J. F. Dillon
This figure shows the co-authorship network connecting the top 25 collaborators of J. F. Dillon. A scholar is included among the top collaborators of J. F. Dillon 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 J. F. Dillon. J. F. Dillon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 5 | |
| 3 | Jacobi-like sums and difference sets with Singer parameters. | 1 |
| 4 | 3 | |
| 5 | 6 | |
| 6 | 8 | |
| 7 | 3 | |
| 8 | 159 | |
| 9 | 9 | |
| 10 | 45 | |
| 11 | 29 | |
| 12 | 1 | |
| 13 | 30 | |
| 14 | 5 | |
| 15 | 46 | |
| 16 | 34 | |
| 17 | 13 |
About J. F. Dillon
J. F. Dillon is a scholar working on Discrete Mathematics and Combinatorics, Algebra and Number Theory and Artificial Intelligence, having authored 17 papers that have together received 397 indexed citations. Recurring topics across this work include graph theory and CDMA systems (12 papers), Coding theory and cryptography (11 papers) and Finite Group Theory Research (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (100 citations), Algebra and Number Theory (40 citations) and Artificial Intelligence (277 citations). J. F. Dillon has collaborated with scholars based in United States, Germany and Singapore. Frequent co-authors include Hans Dobbertin, David P. Roselle, K. T. Arasu, Dieter Jungnickel, Alexander Pott, Gary McGuire, Ka Hin Leung, Siu Lun, Xiaoyu Liu and Taylor Applebaum. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Applied Mathematics and Duke Mathematical Journal.
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.