10 citations · 25 across the 6 of their papers we have counts for
11 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…
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 .…