J. D. Key

1.1k total citations
77 papers, 657 citations indexed

About

J. D. Key is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, J. D. Key has authored 77 papers receiving a total of 657 indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Artificial Intelligence, 62 papers in Electrical and Electronic Engineering and 37 papers in Discrete Mathematics and Combinatorics. Recurrent topics in J. D. Key's work include Coding theory and cryptography (64 papers), graph theory and CDMA systems (61 papers) and Finite Group Theory Research (37 papers). J. D. Key is often cited by papers focused on Coding theory and cryptography (64 papers), graph theory and CDMA systems (61 papers) and Finite Group Theory Research (37 papers). J. D. Key collaborates with scholars based in United States, South Africa and United Kingdom. J. D. Key's co-authors include E. F. Assmus, Bernardo G. Rodrigues, Peng Ding, Ernest E. Shult, Johannes Siemons, Neil J. Calkin, Peter Dankelmann, Ascher Wagner, Shuhong Gao and W. N. Everitt and has published in prestigious journals such as IEEE Transactions on Information Theory, Transactions of the American Mathematical Society and Discrete Applied Mathematics.

In The Last Decade

J. D. Key

75 papers receiving 595 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
J. D. Key United States	14	588	442	298	289	83	77	657
Victor Zinoviev Russia	14	901 1.5×	750 1.7×	255 0.9×	158 0.5×	160 1.9×	79	946
Fernanda Pambianco Italy	14	621 1.1×	444 1.0×	522 1.8×	110 0.4×	93 1.1×	104	737
Stefano Marcugini Italy	13	551 0.9×	375 0.8×	429 1.4×	115 0.4×	88 1.1×	96	638
Iwan Duursma United States	13	368 0.6×	178 0.4×	99 0.3×	171 0.6×	99 1.2×	44	450
Daniele Bartoli Italy	14	579 1.0×	340 0.8×	326 1.1×	110 0.4×	85 1.0×	102	638
Wolfgang M. Willems Germany	13	456 0.8×	301 0.7×	327 1.1×	149 0.5×	80 1.0×	82	580
E. F. Assmus United States	17	644 1.1×	550 1.2×	274 0.9×	183 0.6×	174 2.1×	38	786
Qing Xiang United States	16	704 1.2×	668 1.5×	463 1.6×	98 0.3×	144 1.7×	86	871
Robert S. Coulter United States	12	572 1.0×	399 0.9×	192 0.6×	67 0.2×	110 1.3×	37	594
Cem Güneri̇ Türkiye	11	296 0.5×	159 0.4×	103 0.3×	101 0.3×	80 1.0×	30	314

Countries citing papers authored by J. D. Key

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of J. D. Key

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

Key, J. D. & Bernardo G. Rodrigues. (2020). Binary codes from <inline-formula><tex-math id="M1">$ m $</tex-math></inline-formula>-ary <inline-formula><tex-math id="M2">$ n $</tex-math></inline-formula>-cubes <inline-formula><tex-math id="M3">$ Q^m_n $</tex-math></inline-formula>. Advances in Mathematics of Communications. 15(3). 507–524. 2 indexed citations

Key, J. D., et al.. (2013). Codes associated with the odd graphs. Discrete Mathematics. 315-316. 102–111. 1 indexed citations

Key, J. D., et al.. (2011). Codes from the incidence matrices of graphs on 3-sets. Discrete Mathematics. 311(16). 1823–1840. 9 indexed citations

Key, J. D., et al.. (2010). Binary codes from the line graph of the n-cube. Journal of Symbolic Computation. 45(7). 800–812. 9 indexed citations

Key, J. D., et al.. (2010). Codes from incidence matrices and line graphs of Hamming graphs. Discrete Mathematics. 310(13-14). 1884–1897. 20 indexed citations

Key, J. D., et al.. (2009). Partial permutation decoding of some binary codes from graphs on triples.. Ars Combinatoria. 91. 3 indexed citations

Key, J. D., et al.. (2007). Codes from the line graphs of complete multipartite graphs and PD-sets. Discrete Mathematics. 307(17-18). 2217–2225. 2 indexed citations

Key, J. D., et al.. (2007). Permutation decoding for binary codes from lattice graphs. Discrete Mathematics. 308(13). 2862–2867. 9 indexed citations

Key, J. D., et al.. (2007). A lower bound for the minimum weight of the dual 7-ary code of a projective plane of order 49. Designs Codes and Cryptography. 44(1-3). 133–142. 1 indexed citations

10.

Key, J. D., et al.. (2006). Binary codes from graphs on triples and permutation decoding.. Ars Combinatoria. 79. 2 indexed citations

11.

Key, J. D., et al.. (2005). Information sets and partial permutation decoding for codes from finite geometries. Finite Fields and Their Applications. 12(2). 232–247. 32 indexed citations

12.

Key, J. D., et al.. (2004). Binary codes from graphs on triples. Discrete Mathematics. 282(1-3). 171–182. 12 indexed citations

13.

Key, J. D., et al.. (2004). Partial permutation decoding for codes from finite planes. European Journal of Combinatorics. 26(5). 665–682. 31 indexed citations

14.

Key, J. D.. (2001). Some Applications of Magma in Designs and Codes: Oval Designs, Hermitian Unitals and Generalized Reed–Muller Codes. Journal of Symbolic Computation. 31(1-2). 37–53. 13 indexed citations

15.

Key, J. D., et al.. (1999). Steiner Systems From Binary Codes.. Ars Combinatoria. 52. 3 indexed citations

16.

Gao, Shuhong & J. D. Key. (1998). Bases of Minimum-Weight Vectors for Codes from Designs. Finite Fields and Their Applications. 4(1). 1–15. 3 indexed citations

17.

Key, J. D., et al.. (1994). Codewords for Projective Planes from Sets of Type (s, t). European Journal of Combinatorics. 15(3). 259–268. 1 indexed citations

18.

Assmus, E. F. & J. D. Key. (1992). Hadamard matrices and their designs: a coding-theoretic approach. Transactions of the American Mathematical Society. 330(1). 269–293. 16 indexed citations

19.

Assmus, E. F. & J. D. Key. (1990). Affine and projective planes. Discrete Mathematics. 83(2-3). 161–187. 82 indexed citations

20.

Assmus, E. F. & J. D. Key. (1989). Arcs and Ovals in the Hermitian and Ree Unitals. European Journal of Combinatorics. 10(4). 297–308. 12 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