Wenjun Yu

most citedOptimal Fraction Repetition Codes for Access-Balancing in Distributed Storage

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

collaborators

2 papers

cs.IT2019★ 2 cited

Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage

Wenjun Yu, Xiande Zhang, Gennian Ge

To solve the access-balancing problem in distributed storage systems, we introduce a new combinatorial model, called MinVar model for fractional repetition (FR) codes. Since FR cod…

math.CO2019★ 1 cited

Bollobás type theorems for hemi-bundled two families

Wenjun Yu, Xiangliang Kong, Yuanxiao Xi +2

Let ${(A_{i}, B_{i})}_{i = 1}^{m}$ be a collection of pairs of sets with $∣ A_{i} ∣ = a$ and $∣ B_{i} ∣ = b$ for $1 \leq i \leq m$ . Suppose that $A_{i} \cap B_{j} = \emptyset$ if and only if $i = j$ , then by…