Jingjun Bao

Orcid: 0000-0003-3398-5443

According to our database1, Jingjun Bao authored at least 17 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Partial difference sets with Denniston parameters in elementary abelian p-groups.
Finite Fields Their Appl., 2025

2024
New Algebraic and Combinatorial Constructions for Optimal Frequency Hopping Sequence Sets.
IEEE Trans. Inf. Theory, November, 2024

New constructions of optimal frequency hopping sequences.
Appl. Algebra Eng. Commun. Comput., May, 2024

Some New Constructions of Difference Systems of Sets.
Graphs Comb., February, 2024

2023
Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs.
Des. Codes Cryptogr., November, 2023

2022
Large sets of t-designs over finite fields exist for all t.
Des. Codes Cryptogr., 2022

2021
A note on almost partitioned difference families.
Bull. ICA, 2021

2020
Doubly resolvable Steiner quadruple systems of orders 2<sup>2n+1</sup>.
Des. Codes Cryptogr., 2020

2019
Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs.
Graphs Comb., 2019

2018
New existence and nonexistence results for strong external difference families.
Discret. Math., 2018

Four classes of linear codes from cyclotomic cosets.
Des. Codes Cryptogr., 2018

New families of strictly optimal frequency hopping sequence sets.
Adv. Math. Commun., 2018

2016
New Families of Optimal Frequency Hopping Sequence Sets.
IEEE Trans. Inf. Theory, 2016

Frequency Hopping Sequences With Optimal Partial Hamming Correlation.
IEEE Trans. Inf. Theory, 2016

2015
Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs.
Finite Fields Their Appl., 2015

Some series of optimal multilength OOCs of weight four.
Discret. Math., 2015

The completion determination of optimal (3, 4)-packings.
Des. Codes Cryptogr., 2015


  Loading...