Linear block code with locality and availability inspired by tetrahedron

Farkaš, Peter

doi:10.2478/jee-2024-0010

Abstract

The primary application of codes with locality and availability in distributed storage is for data recovery in case that data are lost on some damaged servers. Locality enables the recovery of lost data by contacting only a restricted number of remaining servers. Availability means that more than one subset of servers providing locality is available for data recovery for each server. The secondary application of these codes in distributed storage is to allow access to hot data in times of high demand. In this paper it is shown that the binary linear [14, 4, 7] code has locality 2 and availability 6 and it can be interpreted as a three-dimensional graph obtained from a [7, 3, 4] Simplex code. It is achieving upper bounds on basic parameters for codes with all-symbols locality and availability. This code can be a building element of more complex codes with scalability inspired by three-dimensional structures. The availability spectrum is introduced as a tool for analyzing codes with locality and availability.

References

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 Back to article
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 Back to article
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 Back to article
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 Back to article
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 Back to article
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 Back to article
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 Back to article
M. Grassl, “Code Tables: Bounds on parameters of various types of codes,”[Online]. Available: http://www.codetables.de/
Search in Google Scholar Back to article
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 Back to article
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 Back to article

Linear block code with locality and availability inspired by tetrahedron

Abstract

Paradigm

My account