Scalable codes with locality and availability derived from tessellation via [7, 3, 4] Simplex code graph

[1] J. R. Cordeiro and O. Postolache, “Big Data Storage for a Health Predictive System,” 2018 International Symposium in Sensing and Instrumentation in IoT Era (ISSI), Shanghai, 2018, pp. 1-6. doi: 10.1109/ISSI.2018.8538285 Search in Google Scholar

[2] M. Ger, “Understanding Healthcare’s New Industry Imperative: Data Chain of Custody,” January 27, 2020 Accesed on February 17, 2020, blog.cloudera.com/understanding-healthcares-new-industry imperative-data-chain-of-custody/ Search in Google Scholar

[3] S. Ghemawat, H. Gobioff, and S.-T. Leung, “The Google file system,” in Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP), pages 29–43, 2003 Search in Google Scholar

[4] H. Dau, I. Duursma, H. M. Kiah, and O. Milenkovic, “Repairing Reed–Solomon codes with multiple erasures,” IEEE Trans. Inf. Theory, vol. 64, no. 10, pp. 6567–6582, Oct. 2018 Search in Google Scholar

[5] A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539–4551, Sep. 2010. Search in Google Scholar

[6] A. G. Dimakis, K. Ramchandran, Y. Wu and C. Suh, “A Survey on Network Codes for Distributed Storage,” in Proceedings of the IEEE, vol. 99, no. 3, pp. 476-489, March 2011. Search in Google Scholar

[7] P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, “On the locality of codeword symbols,” IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 6925–6934, Nov. 2011 Search in Google Scholar

[8] V. Guruswami and M. Wootters, “Repairing Reed–Solomon codes,”IEEE Trans. Inf. Theory, vol. 63, no. 9, pp. 5684–5698, Sep. 2017. Search in Google Scholar

[9] H. Dau and O. Milenkovic, “Optimal repair schemes for some families of full-length Reed–Solomon codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2017, pp. 346–350. Search in Google Scholar

[10] M. Ye and A. Barg, “Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2016, pp. 1202–1206. Search in Google Scholar

[11] I. Tamo, M. Ye, and A. Barg, “Optimal repair of Reed–Solomon codes: Achieving the cut-set bound,” in Proc. IEEE 58th Annu. Symp. Found. Comput. Sci. (FOCS), Oct. 2017, pp. 216–227. Search in Google Scholar

[12] W. Li, Z. Wang and H. Jafarkhani, “Repairing Reed-Solomon Codes Over GF(2^l),” in IEEE Communications Letters, vol. 24, no. 1, pp. 34-37, Jan. 2020. Search in Google Scholar

[13] L. Jin, L. Ma and C. Xing, “Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields,” in IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 210-221, Jan. 2020 Search in Google Scholar

[14] E. Yavari and M. Esmaeili, “Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures,” in IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 222-232, Jan. 2020. Search in Google Scholar

[15] G. Micheli, “Constructions of Locally Recoverable Codes Which are Optimal,” in IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 167-175, Jan. 2020. Search in Google Scholar

[16] M. Blaum, “Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes,” in IEEE Transactions on Information Theory, vol. 66, no. 2, pp. 936-956, Feb. 2020. Search in Google Scholar

[17] M. Blaum and S. R. Hetzler, “Array Codes with Local Properties,” in IEEE Transactions on Information Theory, 2020. Search in Google Scholar

[18] X. Xie et al., “AZ-Code: An Efficient Availability Zone Level Erasure Code to Provide High Fault Tolerance in Cloud Storage Systems,” 2019 35th Symposium on Mass Storage Systems and Technologies (MSST), Santa Clara, CA, USA, 2019, pp. 230-243. Search in Google Scholar

[19] P. Huang, E. Yaakobi, H. Uchikawa and P. H. Siegel, “Linear locally repairable codes with availability,” 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015, pp. 1871-1875. Search in Google Scholar

[20] A. Wang, Z. Zhang and M. Liu, “Achieving arbitrary locality and availability in binary codes,” 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015, pp. 1866-1870. Search in Google Scholar

[21] J. Hao, S. Xia and B. Chen, “On the single-parity locally repairable codes with availability,” 2016 IEEE/CIC International Conference on Communications in China (ICCC), Chengdu, 2016, pp. 1-4. Search in Google Scholar

[22] U. D. Kadiyam, “Locality and Availability with Multiple Erasure Correction,” 2018 International Conference on Signal Processing and Communications (SPCOM), Bangalore, India, 2018, pp. 16-20. Search in Google Scholar

[23] S. Kruglik, M. Dudina, V. Potapova and A. Frolov, “On one generalization of LRC codes with availability,” 2017 IEEE Information Theory Workshop (ITW), Kaohsiung, 2017, pp. 26-30. Search in Google Scholar

[24] N. Silberstein, T. Etzion and M. Schwartz, “Locality and Availability of Array Codes Constructed From Subspaces,” in IEEE Transactions on Information Theory, vol. 65, no. 5, pp. 2648-2660, May 2019. Search in Google Scholar

[25] C. Kim and J. No, “New Constructions of Binary LRCs With Disjoint Repair Groups and Locality 3 Using Existing LRCs,” in IEEE Communications Letters, vol. 23, no. 3, pp. 406-409, March 2019. Search in Google Scholar

[26] J.-H. Kim, M.-Y. Nam, and H.-Y. Song, “Binary locally repairable codes from complete multipartite graphs,” in Proc. Int. Conf. ICT Converg. (ICTC), Oct. 2015, pp. 1093–1095. Search in Google Scholar

[27] J.-H. Kim, M.-Y. Nam, K.-H. Park, and H.-Y. Song, “Optimal binary locally repairable codes with joint information locality,” in Proc. IEEE Inf. Theory Workshop (ITW), Oct. 2015, pp. 54–58. Search in Google Scholar

[28] J. Kim and H. Song, “Hypergraph-Based Binary Locally Repairable Codes With Availability,” in IEEE Communications Letters, vol. 21, no. 11, pp. 2332-2335, Nov. 2017. Search in Google Scholar

[29] P. Farkaš, “Scalable Family of Codes with Locality and Availability for Information Repair in Distributed Storage Systems,” 2019 4th International Conference on Smart and Sustainable Technologies (SpliTech), Split, Croatia, 2019, pp. 1-4. Search in Google Scholar

[30] K. Uehara, Y. R. Chen, M. Hiltunen, K. Joshi and R. Schlichting, “Feasibility Study of Location-Conscious Multi-Site Erasure-Coded Ceph Storage for Disaster Recovery,” 2018 IEEE International Conference on Cloud Engineering (IC2E), Orlando, FL, 2018, pp. 204-210. Search in Google Scholar

[31] W. Song and C. Yuen, “Binary Locally Repairable Codes - Sequential Repair for Multiple Erasures,” 2016 IEEE Global Communications Conference (GLOBECOM), Washington, DC, 2016, pp. 1-6. Search in Google Scholar

[32] W. Song, K. Cai, C. Yuen, K. Cai and G. Han, “On Sequential Locally Repairable Codes,” in IEEE Transactions on Information Theory, vol. 64, no. 5, pp. 3513-3527, May 2018. Search in Google Scholar

[33] E. Yavari and M. Esmaeili, “Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures,” in IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 222-232, Jan. 2020. Search in Google Scholar