{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:03:51Z","timestamp":1760241831032,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T00:00:00Z","timestamp":1535155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2018R1D1A1B07051108"],"award-info":[{"award-number":["NRF-2018R1D1A1B07051108"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, a new family of binary LRCs (BLRCs) with locality 2 and uneven availabilities for hot data is proposed, which has a high information symbol availability and low parity symbol availabilities for the local repair of distributed storage systems. The local repair of each information symbol for the proposed codes can be done not by accessing other information symbols but only by accessing parity symbols. The proposed BLRCs with     k = 4     achieve the optimality on the information length for their given code length, minimum Hamming distance, locality, and availability in terms of the well-known theoretical upper bound.<\/jats:p>","DOI":"10.3390\/e20090636","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T10:56:04Z","timestamp":1535367364000},"page":"636","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data"],"prefix":"10.3390","volume":"20","author":[{"given":"Kang-Seok","family":"Lee","sequence":"first","affiliation":[{"name":"Samsung Electronics, Co. Ltd., Hwasung, Gyeonggi-do 18448, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7854-7792","authenticated-orcid":false,"given":"Hosung","family":"Park","sequence":"additional","affiliation":[{"name":"School of Electronics and Computer Engineering, Chonnam National University, Gwangju 61186, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Seon","family":"No","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Institute of New Media and Communications, Seoul National University, Seoul 08826, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"4185","DOI":"10.3390\/e16084185","article-title":"Block access token renewal scheme based on secret sharing in Apache Hadoop","volume":"16","author":"Kim","year":"2014","journal-title":"Entropy"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4533","DOI":"10.3390\/e17074533","article-title":"Reliability analysis based on a jump diffusion model with two Wiener processes for cloud computing with big data","volume":"17","author":"Tamura","year":"2015","journal-title":"Entropy"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Weatherspoon, H., and Kubiatowicz, J. (2002, January 7\u20138). Erasure coding vs. replication: A quantitative comparison. Proceedings of the 1st International Workshop on Peer-to-Peer Systems, Cambridge, MA, USA.","DOI":"10.1007\/3-540-45748-8_31"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","article-title":"Network coding for distributed storage systems","volume":"56","author":"Dimakis","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","unstructured":"Rouayheb, S.E., and Ramchandran, K. (October, January 29). Fractional repetition codes for repair in distributed storage systems. Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Park, H., and Kim, Y.-S. (2016). Construction of fractional repetition codes with variable parameters for distributed storage systems. Entropy, 18.","DOI":"10.3390\/e18120441"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Kim, Y.-S., Park, H., and No, J.-S. (2017). Construction of new fractional repetition codes from relative difference sets with \u03bb=1. Entropy, 19.","DOI":"10.3390\/e19100563"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","article-title":"On the locality of codeword symbols","volume":"58","author":"Gopalan","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","unstructured":"Pamies-Juarez, L., Hollmann, H.D.L., and Oggier, F. (2018, August 22). Locally Repairable Codes with Multiple Repair Alternatives. Available online: https:\/\/arxiv.org\/abs\/1302.5518."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kralevska, K., Gligoroski, D., and \u00d8verby, H. (2016, January 5\u20139). Balanced locally repairable codes. Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, Brest, France.","DOI":"10.1109\/ISTC.2016.7593121"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, A., Zhang, Z., and Liu, M. (2015, January 14\u201319). Achieving arbitrary locality and availability in binary codes. Proceedings of the IEEE International Symposium on Information Theory, Hong Kong, China.","DOI":"10.1109\/ISIT.2015.7282779"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","article-title":"Locality and availability in distributed storage","volume":"62","author":"Rawat","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","article-title":"A family of optimal locally recoverable codes","volume":"60","author":"Tamo","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1109\/TCOMM.2016.2581163","article-title":"A class of binary locally repairable codes","volume":"64","author":"Shahabinejad","year":"2016","journal-title":"IEEE Trans. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1109\/LCOMM.2017.2697424","article-title":"Binary locally repairable codes with minimum distance at least six based on partial t-spreads","volume":"21","author":"Nam","year":"2017","journal-title":"IEEE Commun. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5787","DOI":"10.1109\/TIT.2015.2477406","article-title":"Bounds on the size of locally recoverable codes","volume":"61","author":"Cadambe","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Silberstein, N., and Zeh, A. (2015, January 14\u201319). Optimal binary locally repairable codes via anticodes. Proceedings of the IEEE International Symposium on Information Theory, Hong Kong, China.","DOI":"10.1109\/ISIT.2015.7282655"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Kadhe, S., and Sprintson, A. (2016, January 10\u201315). Codes with unequal locality. Proceedings of the IEEE International Symposium on Information Theory, Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541336"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Zeh, A., and Yaakobi, E. (2016, January 10\u201315). Bounds and constructions of codes with multiple localities. Proceedings of the IEEE International Symposium on Information Theory, Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541377"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/9\/636\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:21:02Z","timestamp":1760196062000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/9\/636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,25]]},"references-count":19,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["e20090636"],"URL":"https:\/\/doi.org\/10.3390\/e20090636","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2018,8,25]]}}}