default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingjun Bao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Lei Wan, Jingjun Bao:
New constructions of optimal frequency hopping sequences. Appl. Algebra Eng. Commun. Comput. 35(3): 407-432 (2024)- [j15]Shuyu Shen, Jingjun Bao
:
Some New Constructions of Difference Systems of Sets. Graphs Comb. 40(1): 6 (2024) - [j14]Jingjun Bao:
New Algebraic and Combinatorial Constructions for Optimal Frequency Hopping Sequence Sets. IEEE Trans. Inf. Theory 70(11): 8276-8288 (2024) - 2023
- [j13]Jingjun Bao:
Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs. Des. Codes Cryptogr. 91(11): 3741-3755 (2023) - 2022
- [j12]Jingjun Bao, Lijun Ji:
Large sets of t-designs over finite fields exist for all t. Des. Codes Cryptogr. 90(7): 1599-1609 (2022) - 2021
- [j11]Jingjun Bao, Marco Buratti, Lijin Ji:
A note on almost partitioned difference families. Bull. ICA 93: 45-51 (2021) - 2020
- [j10]Juanjuan Xu, Jingjun Bao, Lijun Ji:
Doubly resolvable Steiner quadruple systems of orders 22n+1. Des. Codes Cryptogr. 88(11): 2377-2386 (2020)
2010 – 2019
- 2019
- [j9]Jingjun Bao, Lijun Ji:
Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs. Graphs Comb. 35(2): 373-392 (2019) - 2018
- [j8]Jingjun Bao:
New families of strictly optimal frequency hopping sequence sets. Adv. Math. Commun. 12(2): 387-413 (2018) - [j7]Dabin Zheng, Jingjun Bao:
Four classes of linear codes from cyclotomic cosets. Des. Codes Cryptogr. 86(5): 1007-1022 (2018) - [j6]Jingjun Bao, Lijun Ji, Ruizhong Wei, Yong Zhang:
New existence and nonexistence results for strong external difference families. Discret. Math. 341(6): 1798-1805 (2018) - 2016
- [j5]Jingjun Bao, Lijun Ji:
Frequency Hopping Sequences With Optimal Partial Hamming Correlation. IEEE Trans. Inf. Theory 62(6): 3768-3783 (2016) - [j4]Jingjun Bao, Lijun Ji:
New Families of Optimal Frequency Hopping Sequence Sets. IEEE Trans. Inf. Theory 62(9): 5209-5224 (2016) - [i3]Jingjun Bao:
New families of Strictly optimal Frequency hopping sequence sets. CoRR abs/1610.03587 (2016) - 2015
- [j3]Jingjun Bao, Lijun Ji:
The completion determination of optimal (3, 4)-packings. Des. Codes Cryptogr. 77(1): 217-229 (2015) - [j2]Jingjun Bao, Lijun Ji, Yang Li, Chengmin Wang:
Some series of optimal multilength OOCs of weight four. Discret. Math. 338(12): 2549-2561 (2015) - [j1]Jingjun Bao, Lijun Ji, Yang Li, Chengmin Wang:
Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs. Finite Fields Their Appl. 35: 139-158 (2015) - [i2]Jingjun Bao, Lijun Ji:
New families of optimal frequency hopping sequence sets. CoRR abs/1506.07372 (2015) - [i1]Jingjun Bao, Lijun Ji:
Frequency hopping sequences with optimal partial Hamming correlation. CoRR abs/1511.02924 (2015)
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-11-19 21:46 CET 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:
