35 citations · 285 across the 85 of their papers we have counts for
86 papers
A new variant of the Erdős-Gyárfás problem on
Gennian Ge, Zixiang Xu, Yixuan Zhang
Motivated by an extremal problem on graph-codes that links coding theory and graph theory, Alon recently proposed a question aiming to find the smallest number such that there…
New constructions of signed difference sets
Zhiwen He, Tingting Chen, Gennian Ge
Signed difference sets have interesting applications in communications and coding theory. A -difference set in a finite group of order is a subset of with…
Reconstruction of Sequences Distorted by Two Insertions
Zuo Ye, Xin Liu, Xiande Zhang +1
Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in…
On supersaturation for oddtown and eventown
Xin Wei, Yuhao Zhao, Xiande Zhang +1
We study the supersaturation problems of oddtown and eventown. Given a family of subsets of an element set, let denote the number of distinct pair…
Some results on similar configurations in subsets of
Chengfei Xie, Gennian Ge
In this paper, we study problems about the similar configurations in . Let be a graph, where and . For a s…
On lattice tilings of by limited magnitude error balls
Tao Zhang, Yanlu Lian, Gennian Ge
Limited magnitude error model has applications in flash memory. In this model, a perfect code is equivalent to a tiling of by limited magnitude error balls. In this…