Jonathan Jedwab

2.6k total citations · 1 hit paper
59 papers, 1.5k citations indexed

About

Jonathan Jedwab is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Jonathan Jedwab has authored 59 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Electrical and Electronic Engineering, 30 papers in Artificial Intelligence and 11 papers in Computer Networks and Communications. Recurrent topics in Jonathan Jedwab's work include graph theory and CDMA systems (35 papers), Coding theory and cryptography (29 papers) and PAPR reduction in OFDM (13 papers). Jonathan Jedwab is often cited by papers focused on graph theory and CDMA systems (35 papers), Coding theory and cryptography (29 papers) and PAPR reduction in OFDM (13 papers). Jonathan Jedwab collaborates with scholars based in Canada, United States and United Kingdom. Jonathan Jedwab's co-authors include James Davis, James A. Davis, Matthew G. Parker, Chris J. Mitchell, F. Fiedler, F. Fiedler, Richard G. Gibson, Kai‐Uwe Schmidt, Peter Borwein and Daniel J. Katz and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Communications and Electronics Letters.

In The Last Decade

Jonathan Jedwab

53 papers receiving 1.4k citations

Hit Papers

Peak-to-mean power control in OFDM, Golay complementary s... 1999 2026 2008 2017 1999 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
    1999 699 citations Jonathan Jedwab et al. IEEE Transactions on Information Theory profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jonathan Jedwab Canada 15 1.3k 744 470 166 99 59 1.5k
B. Sundar Rajan India 26 3.7k 2.8× 3.1k 4.2× 1.1k 2.3× 190 1.1× 45 0.5× 342 4.0k
J.-C. Belfiore France 19 2.8k 2.1× 2.4k 3.2× 1.0k 2.1× 138 0.8× 26 0.3× 66 3.0k
R. Michael Tanner United States 14 2.4k 1.8× 2.7k 3.6× 616 1.3× 33 0.2× 52 0.5× 23 3.0k
C. Heegard United States 18 1.5k 1.1× 1.3k 1.7× 685 1.5× 32 0.2× 57 0.6× 43 2.0k
Tom Høholdt Denmark 18 495 0.4× 267 0.4× 763 1.6× 36 0.2× 132 1.3× 50 963
A. Roger Hammons United States 14 2.0k 1.5× 1.3k 1.7× 1.3k 2.7× 80 0.5× 461 4.7× 46 2.2k
Konstantinos Drakakis Ireland 14 290 0.2× 93 0.1× 152 0.3× 103 0.6× 46 0.5× 64 521
J. Justesen Denmark 17 436 0.3× 341 0.5× 671 1.4× 16 0.1× 46 0.5× 46 874
U. Fincke Austria 5 717 0.5× 649 0.9× 264 0.6× 40 0.2× 9 0.1× 6 970
Ning Cai China 15 1.3k 1.0× 1.4k 1.9× 435 0.9× 11 0.1× 42 0.4× 84 1.8k

Countries citing papers authored by Jonathan Jedwab

Since Specialization
Citations

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

Fields of papers citing papers by Jonathan Jedwab

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jonathan Jedwab

This figure shows the co-authorship network connecting the top 25 collaborators of Jonathan Jedwab. A scholar is included among the top collaborators of Jonathan Jedwab 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 Jonathan Jedwab. Jonathan Jedwab 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.
Jedwab, Jonathan. (2024). The Mean and Variance of the Reciprocal Merit Factor of Four Classes of Binary Sequences. IEEE Transactions on Information Theory. 70(12). 9227–9238. 2 indexed citations
2.
Jedwab, Jonathan, Shuxing Li, & Samuel Simon. (2023). Constructions and Restrictions for Balanced Splittable Hadamard Matrices. The Electronic Journal of Combinatorics. 30(1).
3.
Applebaum, Taylor, et al.. (2023). Constructions of difference sets in nonabelian 2-groups. Algebra & Number Theory. 17(2). 359–396.
4.
Jedwab, Jonathan, et al.. (2018). Costas Cubes. IEEE Transactions on Information Theory. 2 indexed citations
5.
Jedwab, Jonathan, et al.. (2015). Large sets of complex and real equiangular lines. Journal of Combinatorial Theory Series A. 134. 98–102. 4 indexed citations
6.
Jedwab, Jonathan, Daniel J. Katz, & Kai‐Uwe Schmidt. (2013). Advances in the merit factor problem for binary sequences. Journal of Combinatorial Theory Series A. 120(4). 882–906. 15 indexed citations
7.
Jedwab, Jonathan, Daniel J. Katz, & Kai‐Uwe Schmidt. (2013). Littlewood polynomials with smallL4norm. Advances in Mathematics. 241. 127–136. 11 indexed citations
8.
Jedwab, Jonathan & Kai‐Uwe Schmidt. (2012). TheL4norm of Littlewood polynomials derived from the Jacobi symbol. Pacific Journal of Mathematics. 257(2). 395–418. 1 indexed citations
9.
Jedwab, Jonathan, et al.. (2012). The $n$-Card Problem, Stochastic Matrices, and the Extreme Principle. The Electronic Journal of Combinatorics. 19(2).
10.
Jedwab, Jonathan, et al.. (2010). A new source of seed pairs for Golay sequences of length 2m. Journal of Combinatorial Theory Series A. 117(5). 589–597. 8 indexed citations
11.
Fiedler, F., Jonathan Jedwab, & Matthew G. Parker. (2008). A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. Journal of Combinatorial Theory Series A. 115(5). 753–776. 52 indexed citations
12.
Davis, James, Jonathan Jedwab, & K. Smith. (2007). Proof of the Barker array conjecture. Proceedings of the American Mathematical Society. 135(7). 2011–2018. 7 indexed citations
13.
Jedwab, Jonathan & Matthew G. Parker. (2007). Golay complementary array pairs. Designs Codes and Cryptography. 44(1-3). 209–216. 40 indexed citations
14.
Borwein, Peter, et al.. (2004). Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>. IEEE Transactions on Information Theory. 50(12). 3234–3249. 29 indexed citations
15.
Davis, James A., Jonathan Jedwab, & Miranda Mowbray. (1998). New Families of Semi-Regular Relative Difference Sets. Designs Codes and Cryptography. 13(2). 131–146. 12 indexed citations
16.
Davis, James A. & Jonathan Jedwab. (1997). A Unifying Construction for Difference Sets. Journal of Combinatorial Theory Series A. 80(1). 13–78. 57 indexed citations
17.
Jedwab, Jonathan & James A. Davis. (1993). Non-existence of certain perfect binary arrays. Electronics Letters. 29(1). 99–101. 3 indexed citations
18.
Arasu, K. T., James A. Davis, Jonathan Jedwab, & Surinder K. Sehgal. (1993). New constructions of menon difference sets. Journal of Combinatorial Theory Series A. 64(2). 329–336. 13 indexed citations
19.
Jedwab, Jonathan & Sheelagh Lloyd. (1992). A note on the nonexistence of Barker sequences. Designs Codes and Cryptography. 2(1). 93–97. 12 indexed citations
20.
Gillis, J., Jonathan Jedwab, & Doron Zeilberger. (1988). A Combinatorial Interpretation of the Integral of the Product of Legendre Polynomials. SIAM Journal on Mathematical Analysis. 19(6). 1455–1461. 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

Breakdown of academic impact, for papers by B. Sundar Rajan Breakdown of academic impact, for papers by J.-C. Belfiore Breakdown of academic impact, for papers by R. Michael Tanner Breakdown of academic impact, for papers by C. Heegard Breakdown of academic impact, for papers by Tom Høholdt Breakdown of academic impact, for papers by A. Roger Hammons Breakdown of academic impact, for papers by Konstantinos Drakakis Breakdown of academic impact, for papers by J. Justesen Breakdown of academic impact, for papers by U. Fincke Breakdown of academic impact, for papers by Ning Cai
Rankless by CCL
2026