1 citations · 2 across the 3 of their papers we have counts for
6 papers
New Constructions of Optimal Locally Repairable Codes with Super-Linear Length
Xiangliang Kong, Xin Wang, Gennnian Ge
As an important coding scheme in modern distributed storage systems, locally repairable codes (LRCs) have attracted a lot of attentions from perspectives of both practical applicat…
Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
Xiangliang Kong, Yuanxiao Xi, Bingchen Qian +1
Ever since the famous Erdős-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various comb…
On an inverse problem of the Erdős-Ko-Rado type theorems
Xiangliang Kong, Gennian Ge
A family of subsets is called intersecting if any two of its members share a common element. Consider an intersecting family, a direct problem…
New bounds and constructions for constant weighted -codes
Xiangliang Kong, Xin Wang, Gennian Ge
As a crucial technique for integrated circuits (IC) test response compaction, -compact employs a special kind of codes called -codes for reliable compressions of the test res…
New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies
Xiangliang Kong, Jingxue Ma, Gennian Ge
In recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. A…
Multi-part cross-intersecting families
Xiangliang Kong, Yuanxiao Xi, Gennian Ge
Let and be two families of subsets of , we say and are cross-intersecting…