A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures
暂无分享,去创建一个
[1] P. Vijay Kumar,et al. Codes with hierarchical locality , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[2] Alexandros G. Dimakis,et al. Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[3] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[4] Alex Samorodnitsky,et al. On Coset Leader Graphs of LDPC Codes , 2014, IEEE Transactions on Information Theory.
[5] Chau Yuen,et al. Optimal Locally Repairable Linear Codes , 2014, IEEE Journal on Selected Areas in Communications.
[6] Giuliana P. Davidoff,et al. Elementary number theory, group theory, and Ramanujan graphs , 2003 .
[7] Frédérique Oggier,et al. Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.
[8] Chau Yuen,et al. Binary Locally Repairable Codes - Sequential Repair for Multiple Erasures , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).
[9] Andrew Thangaraj,et al. Deterministic constructions for large girth protograph LDPC codes , 2013, 2013 IEEE International Symposium on Information Theory.
[10] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[11] Masoud Ardakani,et al. On minimum distance of locally repairable codes , 2017, 2017 15th Canadian Workshop on Information Theory (CWIT).
[12] P. Vijay Kumar,et al. Codes with local regeneration , 2012, 2013 IEEE International Symposium on Information Theory.
[13] Dimitris S. Papailiopoulos,et al. XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..
[14] D. Burshtein,et al. Upper bounds on the rate of LDPC codes , 2002, Proceedings IEEE International Symposium on Information Theory,.
[15] Camilla Hollanti,et al. Constructions of optimal and almost optimal locally repairable codes , 2014, 2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE).
[16] Zhifang Zhang,et al. Repair locality from a combinatorial perspective , 2014, 2014 IEEE International Symposium on Information Theory.
[17] Xin Wang,et al. Some Improvements on Locally Repairable Codes , 2015, ArXiv.
[18] Sriram Vishwanath,et al. Cooperative local repair in distributed storage , 2014, EURASIP Journal on Advances in Signal Processing.
[19] Cheng Huang,et al. Explicit Maximally Recoverable Codes With Locality , 2013, IEEE Transactions on Information Theory.
[20] Minghua Chen,et al. On the Maximally Recoverable Property for Multi-Protection Group Codes , 2007, 2007 IEEE International Symposium on Information Theory.
[21] Chau Yuen,et al. Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance , 2015, ArXiv.
[22] Wentu Song,et al. On Sequential Locally Repairable Codes , 2018, IEEE Transactions on Information Theory.
[23] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.
[24] Xavier Dahan,et al. Regular graphs of large girth and arbitrary degree , 2011, Comb..
[25] P. Vijay Kumar,et al. Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[26] Guangda Hu,et al. New constructions of SD and MR codes over small finite fields , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[27] Zhifang Zhang,et al. An Integer Programming-Based Bound for Locally Repairable Codes , 2014, IEEE Transactions on Information Theory.
[28] Mario Blaum,et al. Partial-MDS Codes and Their Application to RAID Type of Architectures , 2012, IEEE Transactions on Information Theory.
[29] M. Murty. Ramanujan Graphs , 1965 .
[30] Cheng Huang,et al. On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.
[31] F. Lazebnik,et al. A new series of dense graphs of high girth , 1995, math/9501231.
[32] Cheng Huang,et al. Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.
[33] G. Exoo,et al. Dynamic Cage Survey , 2011 .
[34] Sriram Vishwanath,et al. Cooperative local repair in distributed storage , 2014, 2014 48th Annual Conference on Information Sciences and Systems (CISS).
[35] Zoltán Füredi,et al. Graphs of Prescribed Girth and Bi-Degree , 1995, J. Comb. Theory, Ser. B.
[36] Alexey A. Frolov,et al. An upper bound on the minimum distance of LDPC codes over GF(q) , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[37] P. Vijay Kumar,et al. Codes with locality for two erasures , 2014, 2014 IEEE International Symposium on Information Theory.
[38] Balaji Srinivasan Babu,et al. On partial maximally-recoverable and maximally-recoverable codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[39] Frédérique E. Oggier,et al. Locally repairable codes with multiple repair alternatives , 2013, 2013 IEEE International Symposium on Information Theory.
[40] Simon Litsyn,et al. Upper bounds on the rate of LDPC codes as a function of minimum distance , 2002, IEEE Transactions on Information Theory.
[41] Zhifang Zhang,et al. Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.
[42] Balaji Srinivasan Babu,et al. A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length , 2018, 2018 Twenty Fourth National Conference on Communications (NCC).
[43] Balaji Srinivasan Babu,et al. Binary codes with locality for multiple erasures having short block length , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[44] O. Ozan Koyluoglu,et al. A General Construction for PMDS Codes , 2017, IEEE Communications Letters.
[45] Moshe Morgenstern,et al. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.
[46] Balaji Srinivasan Babu,et al. Binary Codes with Locality for Four Erasures , 2016, ArXiv.
[47] Dimitris S. Papailiopoulos,et al. Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.
[48] 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).
[49] Itzhak Tamo,et al. A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.
[50] Luis Alfonso Lastras-Montaño,et al. Reliable Memories with Subline Accesses , 2007, 2007 IEEE International Symposium on Information Theory.
[51] Itzhak Tamo,et al. Bounds on the Parameters of Locally Recoverable Codes , 2015, IEEE Transactions on Information Theory.
[52] Sergey Yekhanin,et al. On the locality of codeword symbols in non-linear codes , 2013, Discret. Math..