ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
暂无分享,去创建一个
Venkatesan Guruswami | Satyanarayana V. Lokam | Sai Vikneshwar Mani Jayaraman | V. Guruswami | Sai Vikneshwar Mani Jayaraman
[1] P. Vijay Kumar,et al. An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair , 2016, ArXiv.
[2] Syed Hussain,et al. Clay Codes: Moulding MDS Codes to Yield an MSR Code , 2018, FAST.
[3] Balaji Srinivasan Babu,et al. Erasure coding for distributed storage: an overview , 2018, Science China Information Sciences.
[4] Chaoping Xing,et al. Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes , 2012, IEEE Transactions on Information Theory.
[5] A. Robert Calderbank,et al. An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes , 2013, IEEE Transactions on Information Theory.
[6] Dimitris S. Papailiopoulos,et al. Repair Optimal Erasure Codes Through Hadamard Designs , 2011, IEEE Transactions on Information Theory.
[7] Nihar B. Shah,et al. Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.
[8] Jie Li,et al. A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems , 2016, IEEE Transactions on Information Theory.
[9] Jie Li,et al. A Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth , 2019, ArXiv.
[10] Cem Güneri. Algebraic geometric codes: basic notions , 2008 .
[11] Venkatesan Guruswami,et al. An exponential lower bound on the sub-packetization of MSR codes , 2019, Electron. Colloquium Comput. Complex..
[12] Jehoshua Bruck,et al. Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.
[13] S. Vladut,et al. Number of points of an algebraic curve , 1983 .
[14] Venkatesan Guruswami,et al. Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[15] P. Vijay Kumar,et al. An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair , 2016, ArXiv.
[16] Venkatesan Guruswami,et al. MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth , 2017, IEEE Transactions on Information Theory.
[17] Venkatesan Guruswami,et al. ∊-MSR codes with small sub-packetization , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[18] Alexandros G. Dimakis,et al. Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[19] Balaji Srinivasan Babu,et al. A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).
[20] Kenneth W. Shum,et al. A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound , 2001, IEEE Trans. Inf. Theory.
[21] Alexander Barg,et al. Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization , 2016, IEEE Transactions on Information Theory.
[22] Alexander Barg,et al. Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth , 2016, IEEE Transactions on Information Theory.