activity
20172021
most citedSome new bounds of placement delivery arrays

1 citations · 2 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2021

The Hamilton-Waterloo problem on wreath product graph

L. Wang, H. Cao

The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP asks for a -factorization of containing -factors a…

math.CO2018

The spectrum for large sets of -GDDs of type

X. Niu, H. Cao, R. Javadi

In this paper, we completely solve the existence of large sets of -GDDs of type and the existence of a simple -GDD of type .

math.CO2018

Non-existence of perfect binary sequences

X. Niu, H. Cao, K. Feng

Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary peri…

math.CO2017

Some results on generalized strong external difference families

X. Lu, X. Niu, H. Cao

A generalized strong external difference family (briefly -GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we construct s…

math.CO20171 cited

Completing the spectrum of almost resolvable cycle systems with odd cycle length

L. Wang, H. Cao

In this paper, we construct almost resolvable cycle systems of order for odd . This completes the proof of the existence of almost resolvable cycle systems with odd…

cs.IT20171 cited

Some new bounds of placement delivery arrays

X. Niu, H. Cao

Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Ya…