default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Jedwab
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j39]Jonathan Jedwab, Shuxing Li, Samuel Simon:
Constructions and Restrictions for Balanced Splittable Hadamard Matrices. Electron. J. Comb. 30(1) (2023)- [j38]Jingzhou Na, Jonathan Jedwab
, Shuxing Li:
A group-based structure for perfect sequence covering arrays. Des. Codes Cryptogr. 91(3): 951-970 (2023) - 2022
- [i8]Jonathan Jedwab, Shuxing Li, Samuel Simon:
Constructions and restrictions for balanced splittable Hadamard matrices. CoRR abs/2207.03619 (2022) - [i7]Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens:
Sets of mutually orthogoval projective and affine planes. CoRR abs/2210.11961 (2022) - 2021
- [j37]Aki Ayukawa Avis, Jonathan Jedwab:
Three-phase Golay sequence and array triads. J. Comb. Theory A 180: 105422 (2021) - [c5]Ivan Lau, Jonathan Jedwab:
Construction of binary matrices for near-optimal compressed sensing. ISIT 2021: 1612-1617 - 2020
- [j36]Matt DeVos, Adam Dyck, Jonathan Jedwab, Samuel Simon:
Which Graphs Occur as γ-Graphs? Graphs Comb. 36(4): 1219-1246 (2020) - [j35]Jonathan Jedwab, Tara Petrie, Samuel Simon:
An infinite class of unsaturated rooted trees corresponding to designable RNA secondary structures. Theor. Comput. Sci. 833: 147-163 (2020)
2010 – 2019
- 2019
- [i6]Jonathan Jedwab:
The distribution of the L4 norm of Littlewood polynomials. CoRR abs/1911.11246 (2019) - 2018
- [j34]Jonathan Jedwab, Lily Yen:
Costas Cubes. IEEE Trans. Inf. Theory 64(4): 3144-3149 (2018) - 2017
- [j33]Justin H. C. Chan, Jonathan Jedwab:
Constructions and nonexistence results for suitable sets of permutations. J. Comb. Theory A 148: 183-196 (2017) - [i5]Jonathan Jedwab, Lily Yen:
Costas cubes. CoRR abs/1702.05473 (2017) - [i4]Jonathan Jedwab, Tara Petrie, Samuel Simon:
The combinatorial RNA design problem. CoRR abs/1709.08088 (2017) - 2016
- [j32]Jonathan Jedwab, Amy Wiebe:
Constructions of complex equiangular lines from mutually unbiased bases. Des. Codes Cryptogr. 80(1): 73-89 (2016) - 2015
- [j31]Jonathan Jedwab, Amy Wiebe:
Large sets of complex and real equiangular lines. J. Comb. Theory A 134: 98-102 (2015) - 2014
- [j30]Jonathan Jedwab, Jane Wodlinger:
Structural properties of Costas arrays. Adv. Math. Commun. 8(3): 241-256 (2014) - [j29]Tor Helleseth, Jonathan Jedwab:
Special issue editorial: Sequences and their applications. Cryptogr. Commun. 6(1): 1-2 (2014) - [j28]Jonathan Jedwab, Jane Wodlinger:
The Deficiency of Costas Arrays. IEEE Trans. Inf. Theory 60(12): 7947-7954 (2014) - 2013
- [j27]Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt:
Advances in the merit factor problem for binary sequences. J. Comb. Theory A 120(4): 882-906 (2013) - [j26]Jonathan Jedwab, Mark Strange:
Wavelength Isolation Sequence Design. IEEE Trans. Inf. Theory 59(5): 3210-3214 (2013) - [p1]Jonathan Jedwab, Kai-Uwe Schmidt:
Finite fields in engineering. Handbook of Finite Fields 2013: 841-850 - 2012
- [j25]Justin H. C. Chan, Jonathan Jedwab:
The n-Card Problem, Stochastic Matrices, and the Extreme Principle. Electron. J. Comb. 19(2): 53 (2012) - [c4]Jonathan Jedwab, Jane Wodlinger:
Wavelength Isolation Sequence Pairs. SETA 2012: 126-135 - [e1]Tor Helleseth, Jonathan Jedwab:
Sequences and Their Applications - SETA 2012 - 7th International Conference, Waterloo, ON, Canada, June 4-8, 2012. Proceedings. Lecture Notes in Computer Science 7280, Springer 2012, ISBN 978-3-642-30614-3 [contents] - [i3]Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt:
Littlewood Polynomials with Small $L^4$ Norm. CoRR abs/1205.0260 (2012) - [i2]Jonathan Jedwab, Daniel J. Katz, Kai-Uwe Schmidt:
Advances in the merit factor problem for binary sequences. CoRR abs/1205.0626 (2012) - 2011
- [j24]Richard G. Gibson, Jonathan Jedwab:
Quaternary Golay sequence pairs I: even length. Des. Codes Cryptogr. 59(1-3): 131-146 (2011) - [j23]Richard G. Gibson, Jonathan Jedwab:
Quaternary Golay sequence pairs II: odd length. Des. Codes Cryptogr. 59(1-3): 147-157 (2011) - [i1]Jonathan Jedwab, Kai-Uwe Schmidt:
The L_4 norm of Littlewood polynomials derived from the Jacobi symbol. CoRR abs/1105.5180 (2011) - 2010
- [j22]Frank Fiedler, Jonathan Jedwab, Amy Wiebe:
A new source of seed pairs for Golay sequences of length 2m. J. Comb. Theory A 117(5): 589-597 (2010) - [c3]Jonathan Jedwab, Kai-Uwe Schmidt:
Appended m-Sequences with Merit Factor Greater than 3.34. SETA 2010: 204-216
2000 – 2009
- 2009
- [j21]Kai-Uwe Schmidt, Jonathan Jedwab, Matthew Geoffrey Parker:
Two binary sequence families with large merit factor. Adv. Math. Commun. 3(2): 135-156 (2009) - 2008
- [j20]Frank Fiedler, Jonathan Jedwab, Matthew Geoffrey Parker:
A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. J. Comb. Theory A 115(5): 753-776 (2008) - [j19]Frank Fiedler, Jonathan Jedwab, Matthew Geoffrey Parker:
A Framework for the Construction ofGolay Sequences. IEEE Trans. Inf. Theory 54(7): 3114-3129 (2008) - 2007
- [j18]Denis Dmitriev, Jonathan Jedwab:
Bounds on the growth rate of the peak sidelobe level of binary sequences. Adv. Math. Commun. 1(4): 461-475 (2007) - [j17]Jonathan Jedwab, Matthew Geoffrey Parker:
There are no Barker arrays having more than two dimensions. Des. Codes Cryptogr. 43(2-3): 79-84 (2007) - [j16]Jonathan Jedwab, Matthew Geoffrey Parker:
Golay complementary array pairs. Des. Codes Cryptogr. 44(1-3): 209-216 (2007) - [j15]S. E. C. Crouch, James A. Davis, Jonathan Jedwab:
The Design of the IEEE 802.12 Coding Scheme. IEEE Trans. Commun. 55(10): 1907-1917 (2007) - 2006
- [j14]Jonathan Jedwab, Kayo Yoshida:
The peak sidelobe level of families of binary sequences. IEEE Trans. Inf. Theory 52(5): 2247-2254 (2006) - [j13]Frank Fiedler, Jonathan Jedwab:
How Do More Golay Sequences Arise? IEEE Trans. Inf. Theory 52(9): 4261-4266 (2006) - [c2]Jonathan Jedwab, Kayo Yoshida:
The Peak Sidelobe Level of Families of Binary Sequences. ISIT 2006: 1658-1662 - 2004
- [j12]Peter B. Borwein, Kwok-Kwong Stephen Choi, Jonathan Jedwab:
Binary sequences with merit factor greater than 6.34. IEEE Trans. Inf. Theory 50(12): 3234-3249 (2004) - [c1]Jonathan Jedwab:
A Survey of the Merit Factor Problem for Binary Sequences. SETA 2004: 30-55
1990 – 1999
- 1999
- [j11]James A. Davis, Jonathan Jedwab:
Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes. IEEE Trans. Inf. Theory 45(7): 2397-2417 (1999) - 1998
- [j10]James A. Davis, Jonathan Jedwab, Miranda Mowbray:
New Families of Semi-Regular Relative Difference Sets. Des. Codes Cryptogr. 13(2): 131-146 (1998) - 1997
- [j9]James A. Davis, Jonathan Jedwab:
A Unifying Construction for Difference Sets. J. Comb. Theory A 80(1): 13-78 (1997) - 1995
- [j8]K. T. Arasu, James A. Davis, Jonathan Jedwab:
A Nonexistence Result for Abelian Menon Difference Sets Using Perfect Binary Arrays. Comb. 15(3): 311-317 (1995) - 1994
- [j7]Jonathan Jedwab, Chris J. Mitchell, Fred Piper, Peter R. Wild:
Perfect binary arrays and difference sets. Discret. Math. 125(1-3): 241-254 (1994) - 1993
- [j6]James A. Davis, Jonathan Jedwab:
A Note on New Semi-Regular Divisible Difference Sets. Des. Codes Cryptogr. 3(4): 379-381 (1993) - [j5]K. T. Arasu, James A. Davis, Jonathan Jedwab, Surinder K. Sehgal:
New Constructions of Menon Difference Sets. J. Comb. Theory A 64(2): 329-336 (1993) - [j4]Jonathan Jedwab:
Barker Arrays I: Even Number of Elements. SIAM J. Discret. Math. 6(2): 294-308 (1993) - [j3]Jonathan Jedwab, Sheelagh Lloyd, Miranda Mowbray:
Barker Arrays II: ODD Numer of Elements. SIAM J. Discret. Math. 6(2): 309-328 (1993) - 1992
- [j2]Jonathan Jedwab:
Generalized Perfect Arrays and {Menon} Difference Sets. Des. Codes Cryptogr. 2(1): 19-68 (1992) - [j1]Jonathan Jedwab, Sheelagh Lloyd:
A Note on the Nonexistence of Barker Sequences. Des. Codes Cryptogr. 2(1): 93-97 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
