activity
20102020
most citedInfinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order

1 citations · 2 across the 8 of their papers we have counts for

collaborators

11 papers

cs.IT2020

Sparse and Balanced MDS Codes over Small Fields

Tingting Chen, Xiande Zhang

Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load.…

math.CO2020

Optimal Ternary Codes with Weight and Distance in -Metric

Xin Wei, Tingting Chen, Xiande Zhang

The study of constant-weight codes in -metric was motivated by the duplication-correcting problem for data storage in live DNA. It is interesting to determine the maximum s…

cs.IT2020

Optimal codes with small constant weight in -metric

Tingting Chen, Yiming Ma, Xiande Zhang

Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in -metric. By using packings and group div…

cs.IT2019

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…

cs.IT2019

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…

cs.IT20191 cited

Repairing Generalized Reed-Muller Codes

Tingting Chen, Xiande Zhang

In distributed storage systems, both the repair bandwidth and locality are important repair cost metrics to evaluate the performance of a storage code. Recently, Guruswami and Woot…