activity
20162026
most citedConstructions and bounds for separating hash families

3 citations · 6 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2026

Constructions for supersaturation of eventown problems

Xiaolei Niu, Yinghui Hang, Haitao Cao

In this paper, we study the supersaturation problems of eventown. Given a family of subsets of an element set, let op denote the number of distinct…

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★ 2 cited

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…

cs.IT2017★ 1 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…

cs.IT2016★ 3 cited

Constructions and bounds for separating hash families

X. Niu, H. Cao

In this paper, we present a new construction for strong separating hash families by using hypergraphs and obtain some optimal separating hash families. We also improve some previou…