9 citations · 10 across the 5 of their papers we have counts for
5 papers
PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access
Jie Li, Xiaohu Tang, Hanxu Hou +3
Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code lengt…
Trading off Quality for Efficiency of Community Detection: An Inductive Method across Graphs
Meng Qin, Chaorui Zhang, Bo Bai +2
Many network applications can be formulated as NP-hard combinatorial optimization problems of community detection (CD). Due to the NP-hardness, to balance the CD quality and effici…
A Convergent Semi-Proximal Alternating Direction Method of Multipliers for Recovering Internet Traffics from Link Measurements
Zhenyu Ming, Liping Zhang, Hao Wu +4
It is challenging to recover the large-scale internet traffic data purely from the link measurements. With the rapid growth of the problem scale, it will be extremely difficult to…
Lower Bound on the Optimal Access Bandwidth of ()-MDS Array Code with Degraded Read Friendly
Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li +4
Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code…
Coded Caching in Fog-RAN: b-Matching Approach
Bo Bai, Wanyi Li, Li Wang +1
Fog radio access network (Fog-RAN), which pushes the caching and computing capabilities to the network edge, is capable of efficiently delivering contents to users by using careful…