10 citations · 13 across the 17 of their papers we have counts for
19 papers
Valley-resolved high harmonics probe symmetry breaking beyond the Dirac cone
Pablo Pais, Alfredo Iorio, Marcelo F. Ciappina
Low-energy electrons in graphene obey an emergent, rotationally invariant Dirac equation, while the honeycomb lattice enters only through higher-order, symmetry-breaking correction…
One Burst of t-Deletion and One Burst of t-Substitution Error-Correcting Codes
Yajuan Liu, Han Cai, Tolga M. Duman
Synchronization errors, including insertions, deletions, and substitutions, may occur in bursts in communication systems such as DNA data storage, file synchronization, and magneti…
Convertible Polynomial Evaluation Codes in the Merge Regime: A Skew-Polynomial Framework
Songping Ge, Han Cai, Xiaohu Tang
In this paper, we develop an algebraic framework for merge-regime convertible codes that works directly with the polynomial-evaluation structure of the underlying codes. We charact…
Convertible Codes: MSR-to-MSR Conversion with Optimal Access and Bandwidth
Yumeng Yang, Han Cai, Xianfu Lei +1
In this paper, we study convertible codes in the merge regime and focus on the minimum storage regenerating (MSR) setting, where both the initial codes and the final code admit opt…
Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
Songping Ge, Han Cai, Xiaohu Tang
In this paper, we consider the convertible code with locally repairable property. We present an improved lower bound on access cost associated with . Then, we provide a gene…
A New Cooperative Repair Scheme with Small Finite Field for Distributed Storage Systems
Yajuan Liu, Han Cai, Xiaohu Tang
In this paper, we consider the multiple failures in the distributed storage systems under the cooperative repair model. We introduce a new cooperative repair scheme for the (n,k,d,…
MDS Generalized Convertible Code
Songping Ge, Han Cai, Xiaohu Tang
In this paper, we consider the convertible codes with the maximum distance separable (MDS) property, which can adjust the code rate according to the failure rates of devices. We fi…
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model
Yumeng Yang, Han Cai, Xiaohu Tang
In this paper, we discuss codes for distributed storage systems with hierarchical repair properties. Specifically, we devote attention to the repair problem of the rack-aware stora…
A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model
Yumeng Yang, Han Cai, Xiaohu Tang
In this paper, we address the node repair problem of Reed-Solomon (RS) coded distributed storage systems. Specifically, to overcome the challenges of multiple-node failures of RS c…
Repairing Schemes for Tamo-Barg Codes
Han Cai, Ying Miao, Moshe Schwartz +1
In this paper, the repair problem for erasures beyond locality in locally repairable codes is explored under a practical system setting, where a rack-aware storage system consists…
A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property
Xing Lin, Han Cai, Xiaohu Tang
In this paper, a new repair scheme for a modified construction of MDS codes is studied. The obtained repair scheme has optimal bandwidth for multiple failed nodes under the coopera…
A New Cooperative Repair Scheme with k + 1 Helper Nodes for (n, k) Hadamard MSR codes with Small Sub-packetization
Yajuan Liu, Han Cai, Xiaohu Tang
Cooperative repair model is an available technology to deal with multiple node failures in distributed storage systems. Recently, explicit constructions of cooperative MSR codes we…
A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It
Han Cai, Moshe Schwartz
We prove a new lower bound on the field size of locally repairable codes (LRCs). Additionally, we construct maximally recoverable (MR) codes which are cyclic. While a known constru…
Optimal Locally Repairable Codes: An Improved Bound and Constructions
Han Cai, Cuiling Fan, Ying Miao +2
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinat…
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size
Han Cai, Ying Miao, Moshe Schwartz +1
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement…
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
Han Cai, Moshe Schwartz
Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code…
Network-Coding Solutions for Minimal Combination Networks and Their Sub-networks
Han Cai, Johan Chrisnata, Tuvi Etzion +2
Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We…
On Optimal Locally Repairable Codes with Super-Linear Length
Han Cai, Ying Miao, Moshe Schwartz +1
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. T…
Optimal Locally Repairable Systematic Codes Based on Packings
Han Cai, Minquan Cheng, Cuiling Fan +1
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and…