35 citations · 285 across the 85 of their papers we have counts for
9 papers · 1 filter
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…
Some New Results on Splitter Sets
Zuo Ye, Tao Zhang, Xiande Zhang +1
Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we gi…
Bollobás type theorems for hemi-bundled two families
Wenjun Yu, Xiangliang Kong, Yuanxiao Xi +2
Let be a collection of pairs of sets with and for . Suppose that if and only if , then by…
3-uniform hypergraphs with few Berge paths of length three between any two vertices
Tao Zhang, Zixiang Xu, Gennian Ge
Recently, Berge theta hypergraphs have received special attention due to the similarity with Berge even cycles. Let -uniform Berge theta hypergraph be the -u…
Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
Zixiang Xu, Tao Zhang, Gennian Ge
Recently, several hypergraph Turán problems were solved by the powerful random algebraic method. However, the random algebraic method usually requires some parameters to be very la…
Some extremal results on hypergraph Turán problems
Zixiang Xu, Tao Zhang, Gennian Ge
For two -graphs and , let be the maximum number of copies of in an -vertex -f…