{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T19:37:51Z","timestamp":1767382671115,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2016,12,8]],"date-time":"2016-12-08T00:00:00Z","timestamp":1481155200000},"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-2014R1A2A2A01006870","NRF-2015R1D1A1A01060941"],"award-info":[{"award-number":["NRF-2014R1A2A2A01006870","NRF-2015R1D1A1A01060941"]}],"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, we propose a new class of regular fractional repetition (FR) codes constructed from perfect difference families and quasi-perfect difference families to store big data in distributed storage systems. The main advantage of the proposed construction method is that it supports a wide range of code parameter values compared to existing ones, which is an important feature to be adopted in practical systems. When using one instance of the proposed codes for a given parameter set, we show that the amount of stored data is very close to that of an existing state-of-the-art optimal FR code.<\/jats:p>","DOI":"10.3390\/e18120441","type":"journal-article","created":{"date-parts":[[2016,12,8]],"date-time":"2016-12-08T10:39:01Z","timestamp":1481193541000},"page":"441","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Construction of Fractional Repetition Codes with Variable Parameters for Distributed Storage Systems"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7854-7792","authenticated-orcid":false,"given":"Hosung","family":"Park","sequence":"first","affiliation":[{"name":"School of Electronics and Computer Engineering, Chonnam National University, Gwangju 61186, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4114-4935","authenticated-orcid":false,"given":"Young-Sik","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Chosun University, Gwangju 61452, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,12,8]]},"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","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_4","doi-asserted-by":"crossref","first-page":"5843","DOI":"10.1109\/TIT.2014.2325570","article-title":"Locally repairable codes","volume":"60","author":"Papailiopoulos","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1109\/JSAC.2014.140521","article-title":"Optimal locally repairable linear codes","volume":"32","author":"Song","year":"2014","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Song, W., and Yuen, C. (2016, January 4\u20138). Binary locally repairable codes\u2014Sequential repair for multiple erasures. Proceedings of the 2016 IEEE Global Communications Conference, Washington, DC, USA.","DOI":"10.1109\/GLOCOM.2016.7841631"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Dau, S.H., Kiah, H.M., Song, W., and Yuen, C. (2015, January 6\u201310). Locally encodable and decodable codes for distributed storage systems. Proceedings of the 2015 IEEE Global Communications Conference, San Diego, CA, USA.","DOI":"10.1109\/GLOCOM.2015.7417648"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Dimakis, A.G., Godfrey, P.B., Wainwright, M.J., and Ramchandran, K. (2007, January 6\u201312). Network coding for distributed storage systems. Proceedings of the 2007 IEEE International Conference on Computer Communications, Anchorage, AK, USA.","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref_9","unstructured":"Wu, Y., Dimakis, A.G., and Ramchandran, K. (2007, January 28\u201330). Deterministic regenerating codes for distributed storage. Proceedings of the 2007 Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA."},{"key":"ref_10","unstructured":"Van, V.T., Yuen, C., and Li, J. (2012, January 1\u20135). Non-homogeneous distributed storage systems. Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Pernas, J., Yuen, C., Gast\u00f3n, B., and Pujol, J. (2013, January 7\u201312). Non-homogeneous two-rack model for distributed storage systems. Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620424"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","article-title":"Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction","volume":"57","author":"Rashmi","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1109\/JSAC.2014.140516","article-title":"Characterizing the rate region of the (4, 3, 3) exact-repair regenerating codes","volume":"32","author":"Tian","year":"2014","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_14","unstructured":"Rouayheb, S.E., and Ramchandran, K. (October, January 29). Fractional repetition codes for repair in distributed storage systems. Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Koo, J.C., and Gill, J.T. (2011, January 28\u201330). Scalable constructions of fractional repetition codes in distributed storage systems. Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, USA.","DOI":"10.1109\/Allerton.2011.6120326"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1109\/TIT.2016.2531720","article-title":"Fractional repetition codes with flexible repair from combinatorial designs","volume":"62","author":"Olmez","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/LCOMM.2014.030114.132694","article-title":"General fractional repetition codes for distributed storage systems","volume":"18","author":"Zhu","year":"2014","journal-title":"IEEE Commun. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/LCOMM.2015.2415495","article-title":"Heterogeneity-aware codes with uncoded repair for distributed storage systems","volume":"19","author":"Zhu","year":"2015","journal-title":"IEEE Commun. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"4164","DOI":"10.1109\/TIT.2015.2442231","article-title":"Optimal fractional repetition codes based on graphs and designs","volume":"61","author":"Silberstein","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Pawar, S., Noorshams, N., Rouayheb, S.E., and Ramchandran, K. (August, January 31). DRESS codes for the storage cloud: Simple randomized constructions. Proceedings of the 2011 IEEE International Symposium on Information Theory, St. Petersburg, Russia.","DOI":"10.1109\/ISIT.2011.6033980"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/JSAC.2014.140523","article-title":"Irregular fractional repetition code optimization for heterogeneous cloud storage","volume":"32","author":"Yu","year":"2014","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., and Dinitz, J.H. (2007). Handbook of Combinatorial Designs, CRC Press. [2nd ed.].","DOI":"10.1201\/9781420010541"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/18\/12\/441\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:28:12Z","timestamp":1760210892000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/18\/12\/441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,8]]},"references-count":22,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2016,12]]}},"alternative-id":["e18120441"],"URL":"https:\/\/doi.org\/10.3390\/e18120441","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2016,12,8]]}}}