10 citations · 40 across the 13 of their papers we have counts for
13 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…
Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth
Hao Shi, Zhengyi Jiang, Zhongyi Huang +2
As a special class of array codes, piggybacking codes are MDS codes (i.e., any out of nodes can retrieve all data symbols) that can achieve low repair bandwidth f…
On MDS Condition and Erased Lines Recovery of Generalized Expanded-Blaum-Roth Codes and Generalized Blaum-Roth Codes
Hanxu Hou, Mario Blaum
Generalized Expanded-Blaum-Roth (GEBR) codes [1] are designed for large-scale distributed storage systems that have larger recoverability for single-symbol failures, multi-column f…
Two New Piggybacking Designs with Lower Repair Bandwidth
Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han +3
Piggybacking codes are a special class of MDS array codes that can achieve small repair bandwidth with small sub-packetization by first creating some instances of an MDS co…
A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding
Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee +3
A maximum distance separable (MDS) array code is composed of arrays such that any out of columns suffice to retrieve all the information symbols. Expanded…
Network Coding Based on Byte-wise Circular Shift and Integer Addition
Kenneth W. Shum, Hanxu Hou
A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The…
Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization
Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han
An maximum distance separable (MDS) code has optimal repair access if the minimum number of symbols accessed from surviving nodes is achieved, where .…
Binary MDS Array Codes with Optimal Repair
Hanxu Hou, Patrick P. C. Lee
Consider a binary maximum distance separable (MDS) array code composed of an array of bits with information columns and parity columns, such that any ou…
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding
Hanxu Hou, Yunghsiang S. Han, Kenneth W. Shum +1
Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popula…
A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair
Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee +2
Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundan…
Rack-Aware Regenerating Codes for Data Centers
Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum +1
Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high,…
Cauchy MDS Array Codes With Efficient Decoding Method
Hanxu Hou, Yunghsiang S. Han
Array codes have been widely used in communication and storage systems. To reduce computational complexity, one important property of the array codes is that only XOR operation is…
Concurrent Regenerating Codes and Scalable Application in Network Storage
Huayu Zhang, Hui Li, Hanxu Hou +2
To recover simultaneous multiple failures in erasure coded storage systems, Patrick Lee et al introduce concurrent repair based minimal storage regenerating codes to reduce repair…