19 citations · 60 across the 17 of their papers we have counts for
19 papers
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…
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…
An efficient implementation of the Shamir secret sharing scheme
Allyson Hineman, Mario Blaum
The Shamir secret sharing scheme requires a Maximum Distance Separable (MDS) code, and in its most common implementation, a Reed-Solomon (RS) code is used. In this paper, we observ…
On Generalized Expanded Blaum-Roth Codes
Mario Blaum
Expanded Blaum-Roth (EBR) codes consist of arrays such that lines of slopes , for , as well as vertical lines, have even parity. The cod…
Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes
Mario Blaum
The traditional definition of Integrated Interleaved (II) codes generally assumes that the component nested codes are either Reed-Solomon (RS) or shortened Reed-Solomon codes. By t…
A Short Course on Error-Correcting Codes
Mario Blaum
When digital data are transmitted over a noisy channel, it is important to have a mechanism allowing recovery against a limited number of errors. Normally, a user string of 0's and…