Linear block code with locality and availability inspired by tetrahedron

[1] A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright and K. Ramchandran, “Network Coding for Distributed Storage Systems,” in IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4539-4551, Sept. 2010, doi: 10.1109/TIT.2010.2054295. Search in Google Scholar

[2] E. Tomes and N. Altiparmak, “A Comparative Study of HDD and SSD RAIDs’ Impact on Server Energy Consumption,” 2017 IEEE International Conference on Cluster Computing (CLUSTER), Honolulu, HI, USA, 2017, pp. 625-626, doi: 10.1109/CLUSTER.2017.103. Search in Google Scholar

[3] J. Wan, J. Wang, Q. Yang and C. Xie, “S2-RAID: A new RAID architecture for fast data recovery,” 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), Incline Village, NV, USA, 2010, pp. 1-9, doi: 10.1109/MSST.2010.5496980. Search in Google Scholar

[4] M. F. Aktaş, S. Kadhe, E. Soljanin and A. Sprintson, “Download Time Analysis for Distributed Storage Codes With Locality and Availability,” in IEEE Transactions on Communications, vol. 69, no. 6, pp. 3898-3910, June 2021, doi: 10.1109/TCOMM.2021.3067054. Search in Google Scholar

[5] 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, doi: 10.23919/SpliTech.2019.8783148. Search in Google Scholar

[6] N. Silberstein and A. Zeh, “Optimal binary locally repairable codes via anticodes,” 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 2015, pp. 1247-1251, doi: 10.1109/ISIT.2015.7282655. Search in Google Scholar

[7] 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, doi: 10.1109/TIT.2019.2934134. Search in Google Scholar

[8] M. Grassl, “Code Tables: Bounds on parameters of various types of codes,”[Online]. Available: http://www.codetables.de/ Search in Google Scholar

[9] S. Kruglik, K. Nazirkhanova and A. Frolov, “New Bounds and Generalizations of Locally Recoverable Codes with Availability,” in IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4156-4166, July 2019, doi: 10.1109/TIT.2019.2897705. Search in Google Scholar

[10] S. Kadhe and R. Calderbank, “Rate optimal binary linear locally repairable codes with small availability,” 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017, pp. 166-170, doi: 10.1109/ISIT.2017.8006511. Search in Google Scholar