Haitao Cao

Orcid: 0000-0002-7083-847X

Affiliations:
  • Nanjing Normal University, Department of Mathematics, China


According to our database1, Haitao Cao authored at least 31 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The existence of (1,m)-near-Skolem sequences.
Australas. J Comb., October, 2023

On a pair of orthogonal golf designs.
Discret. Math., August, 2023

On a conjecture about (<i>m</i><sub>1</sub>, <i>m</i><sub>2</sub>)-near-Skolem sequences.
Discret. Math., 2023

2022
On large set plus of disjoint incomplete Latin squares.
Discret. Math., 2022

2020
Completing the spectrum for three designs related to the graph K4-e.
Discret. Math., 2020

Binary periodic sequences with 2-level autocorrelation values.
Discret. Math., 2020

2018
Completing the spectrum of almost resolvable cycle systems with odd cycle length.
Discret. Math., 2018

A note on the Hamilton-Waterloo problem with C<sub>8</sub>-factors and C<sub>m</sub>-factors.
Discret. Math., 2018

Constructions and bounds for separating hash families.
Discret. Math., 2018

Some results on generalized strong external difference families.
Des. Codes Cryptogr., 2018

2017
Some new bounds of placement delivery arrays.
CoRR, 2017

On the existence of (K<sub>1, 3</sub>, λ)-frames of type g<sup>u</sup>.
Australas. J Comb., 2017

2016
Uniformly resolvable decompositions of K<sub>v</sub> into K<sub>2</sub> and K<sub>1, 3</sub> graphs.
Discret. Math., 2016

Some bounds of separating hash families.
CoRR, 2016

Optimal Placement Delivery Arrays.
CoRR, 2016

2015
On the existence of holey 4-cycle frames.
Discret. Math., 2015

Constructions of large sets of disjoint group-divisible designs using a generalization of.
Discret. Math., 2015

2012
More results on cycle frames and almost resolvable cycle systems.
Discret. Math., 2012

2011
On the existence of cycle frames and almost resolvable cycle systems.
Discret. Math., 2011

Existence of strong symmetric self-orthogonal diagonal Latin squares.
Discret. Math., 2011

2009
Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, 2009

Super-simple group divisible designs with block size 4 and index 5.
Discret. Math., 2009

The existence of HGDDs with block size four and its application to double frames.
Discret. Math., 2009

Super-simple balanced incomplete block designs with block size 4 and index 5.
Discret. Math., 2009

On orthogonal generalized equitable rectangles.
Des. Codes Cryptogr., 2009

2007
Constructions for generalized Steiner systems <i>GS</i> (3, 4, <i>v</i> , 2).
Des. Codes Cryptogr., 2007

2006
Resolvable packings RtildeMP(3, 2; n, n-3) and coverings RtildeMC(3, 2; n, n-2).
Discret. Math., 2006

2004
Large sets of disjoint packings on 6<i>k</i>+5 points.
J. Comb. Theory, Ser. A, 2004

On Kirkman packing designs KPD({3, 4}, <i>v</i>).
Discret. Math., 2004

Kirkman packing designs KPD ({w, s<sup>ast</sup>}, v) and related threshold schemes.
Discret. Math., 2004

2002
Kirkman Packing Designs KPD ({3, 5*}, v).
Des. Codes Cryptogr., 2002


  Loading...