Bounds on Codes with Locality and Availability

In this paper we investigate bounds on rate and minimum distance of codes with $t$ availability. We present bounds on minimum distance of a code with $t$ availability that are tighter than existing bounds. For bounds on rate of a code with $t$ availability, we restrict ourselves to a sub-class of codes with $t$ availability called codes with strict $t$ availability and derive a tighter rate bound. Codes with strict $t$ availability can be defined as the null space of an $(m \times n)$ parity-check matrix $H$, where each row has weight $(r+1)$ and each column has weight $t$, with intersection between support of any two rows atmost one. We also present two general constructions for codes with $t$ availability.

[1]  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..

[2]  P. Vijay Kumar,et al.  Codes with local regeneration , 2012, 2013 IEEE International Symposium on Information Theory.

[3]  P. Vijay Kumar,et al.  Codes with locality for two erasures , 2014, 2014 IEEE International Symposium on Information Theory.

[4]  Frédérique E. Oggier,et al.  Locally repairable codes with multiple repair alternatives , 2013, 2013 IEEE International Symposium on Information Theory.

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

[6]  Bin Chen,et al.  Recursive bounds for locally repairable codes with multiple repair groups , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[7]  Zhifang Zhang,et al.  Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.

[8]  Chau Yuen,et al.  Optimal Locally Repairable Linear Codes , 2014, IEEE Journal on Selected Areas in Communications.

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

[10]  Xin Wang,et al.  Some Improvements on Locally Repairable Codes , 2015, ArXiv.

[11]  Chau Yuen,et al.  Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance , 2015, ArXiv.

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

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

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

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

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

[17]  D. C. Bossen,et al.  Orthogonal latin square codes , 1970 .

[18]  Frédérique Oggier,et al.  Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.

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

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

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

[22]  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).

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