20 citations · 49 across the 17 of their papers we have counts for
19 papers
Sharp Bounds and New Constructions for Single-Error Detection and Correction in Analog Codes
Hengzhuo Li, Zhengjie Jian, Xin Wang +1
We study single-error detection and correction for analog codes over . The key performance measures are the parameters and , which…
New Bounds and Constructions for Variable Packet-Error Coding
Xiangliang Kong, Xin Wang, Ron M. Roth +1
In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination throu…
Covering Grassmannian Codes: Bounds and Constructions
Bingchen Qian, Xin Wang, Chengfei Xie +1
Grassmannian is the set of all -dimensional subspaces of the vector space Recently, Etzion and Zhang introduced a new notion called coveri…
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures
Bingchen Qian, Xin Wang, Gennian Ge
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to positive elements among samples with as few tests a…
Improved Lower Bounds for Secure Codes and Related Structures
Bingchen Qian, Xin Wang, Gennian Ge
Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the…
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…