Block-Punctured Binary Simplex Codes for Local and Parallel Repair in Distributed Storage Systems

In this paper, we investigate how to obtain binary locally repairable codes (LRCs) with good locality and availability from binary Simplex codes. We first propose a Combination code having the generator matrix with all the columns of positive weights less than or equal to a given value. Such a code can be also obtained by puncturing all the columns of weights larger than a given value from a binary Simplex Code. We call by block-puncturing such puncturing method. Furthermore, we suggest a heuristic puncturing method, called subblock-puncturing, that punctures a few more columns of the largest weight from the Combination code. We determine the minimum distance, locality, availability, joint information locality, joint information availability of Combination codes in closed-form. We also demonstrate the optimality of the proposed codes with certain choices of parameters in terms of some well-known bounds. key words: distributed storage systems, locally repairable codes, locality, availability, simplex codes

[1]  A. Robert Calderbank,et al.  Rate optimal binary linear locally repairable codes with small availability , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[2]  Hong-Yeop Song,et al.  Binary locally repairable codes from complete multipartite graphs , 2015, 2015 International Conference on Information and Communication Technology Convergence (ICTC).

[3]  Dongdai Lin,et al.  Two classes of (r, t)-locally repairable codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[4]  Itzhak Tamo,et al.  Bounds on the Parameters of Locally Recoverable Codes , 2015, IEEE Transactions on Information Theory.

[5]  Dimitris S. Papailiopoulos,et al.  Optimal locally repairable codes and connections to matroid theory , 2013, 2013 IEEE International Symposium on Information Theory.

[6]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[7]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.

[8]  Sergey Yekhanin,et al.  On the locality of codeword symbols in non-linear codes , 2013, Discret. Math..

[9]  Hong-Yeop Song,et al.  Alphabet-Dependent Bounds for Locally Repairable Codes With Joint Information Availability , 2017, IEEE Communications Letters.

[10]  Ilya Dumer,et al.  Spherically Punctured Biorthogonal Codes , 2013, IEEE Transactions on Information Theory.

[11]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.

[12]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[13]  Zhifang Zhang,et al.  Repair locality from a combinatorial perspective , 2014, 2014 IEEE International Symposium on Information Theory.

[14]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[15]  Anyu Wang,et al.  Achieving arbitrary locality and availability in binary codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  Dimitris S. Papailiopoulos,et al.  Locality and Availability in Distributed Storage , 2014, IEEE Transactions on Information Theory.

[17]  Hong-Yeop Song,et al.  Hypergraph-Based Binary Locally Repairable Codes With Availability , 2017, IEEE Communications Letters.

[18]  Hong-Yeop Song,et al.  Alphabet-dependent upper bounds for locally repairable codes with joint locality , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[19]  L. Litwin,et al.  Error control coding , 2001 .

[20]  Hong-Yeop Song,et al.  Optimal binary locally repairable codes with joint information locality , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[21]  Sriram Vishwanath,et al.  Cooperative local repair in distributed storage , 2014, 2014 48th Annual Conference on Information Sciences and Systems (CISS).

[22]  Arya Mazumdar,et al.  Bounds on the Size of Locally Recoverable Codes , 2015, IEEE Transactions on Information Theory.

[23]  Paul H. Siegel,et al.  Binary Linear Locally Repairable Codes , 2015, IEEE Transactions on Information Theory.

[24]  Fang-Wei Fu,et al.  On the Locality and Availability of Linear Codes Based on Finite Geometry , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..