11 citations · 13 across the 5 of their papers we have counts for
7 papers · 1 filter
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…
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls
Hengjia Wei, Xin Wang, Moshe Schwartz
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space…
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…
Linear -AONTs do Exist
Xin Wang, Jie Cui, Lijun Ji
A -all-or-nothing transform (AONT) is a bijective mapping defined on -tuples over an alphabet of size , which satisfies that if any of the outputs are give…
A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems
Sheng Guan, Haibin Kan, Xin Wang
Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS…