{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:11:27Z","timestamp":1761808287991},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:00:00Z","timestamp":1558915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:00:00Z","timestamp":1558915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10623-019-00647-4","type":"journal-article","created":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T07:03:11Z","timestamp":1558940591000},"page":"2701-2722","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Functional repair codes: a view from projective geometry"],"prefix":"10.1007","volume":"87","author":[{"given":"Siaw-Lynn","family":"Ng","sequence":"first","affiliation":[]},{"given":"Maura B.","family":"Paterson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,27]]},"reference":[{"key":"647_CR1","unstructured":"Babu B.S., Kumar P.V.: A tight lower bound on the sub-packetization level of optimal-access MSR and MDS codes. In: 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA, June 2018. arXiv:1710.05876 ."},{"key":"647_CR2","unstructured":"Bhagwan R., Tati K., Cheng Y.C., Savage S., Voelker G.M.: Total Recall: System support for automated availability management. In: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation (NSDI\u201904), vol. 1. USENIX Association, pp. 25\u201325. Berkeley, CA, USA."},{"issue":"9","key":"647_CR3","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis A.G., Godfrey P.B., Wu Y., Wainwright M.J., Ramchandran K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"647_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-015-0156-5","volume":"78","author":"T Etzion","year":"2016","unstructured":"Etzion T., Storme L.: Galois geometries and coding theory. Des. Codes Cryptogr. 78(1), 311\u2013350 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"647_CR5","doi-asserted-by":"crossref","unstructured":"Guruswami V., Lokam S.V., Jayaraman S.V.M.: $$\\epsilon $$-MSR codes: contacting fewer code blocks for exact repair. In: 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA. June 2018. arXiv:1807.01166 .","DOI":"10.1109\/ISIT.2018.8437576"},{"key":"647_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries Over Finite Fields","author":"JWP Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P.: Projective Geometries Over Finite Fields, 2nd edn. Oxford University Press, Oxford (1998).","edition":"2"},{"key":"647_CR7","volume-title":"General Galois Geometries","author":"JWP Hirschfeld","year":"1991","unstructured":"Hirschfeld J.W.P., Thas J.A.: General Galois Geometries. Oxford University Press, Oxford (1991)."},{"key":"647_CR8","doi-asserted-by":"crossref","unstructured":"Hollmann H.D.L., Poh W.: Characterizations and construction methods for linear functional-repair storage codes. In: 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, pp. 336\u2013340. Turkey, July 2013. arXiv:1307.5583 .","DOI":"10.1109\/ISIT.2013.6620243"},{"issue":"2","key":"647_CR9","first-page":"165","volume":"29","author":"V Jha","year":"2009","unstructured":"Jha V., Johnson N.L.: Vector space partitions and designs Part I-Basic theory. Note di Matematica 29(2), 165\u2013189 (2009).","journal-title":"Note di Matematica"},{"key":"647_CR10","unstructured":"MacWilliams F.J., Sloane N.J.A.: The theory of error-correcting codes. North Holland (1983)."},{"issue":"8","key":"647_CR11","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1109\/LCOMM.2017.2697424","volume":"21","author":"MY Nam","year":"2017","unstructured":"Nam M.Y., Song H.Y.: Binary locally repairable codes with minimum distance at least six based on partial $$t$$-spreads. IEEE Commun. Lett. 21(8), 1683\u20131686 (2017).","journal-title":"IEEE Commun. Lett."},{"key":"647_CR12","unstructured":"Oggier F., Datta A.: Self-repairing codes for distributed storage\u2014a projective geometric construction. In: IEEE Information Theory Workshop, Paraty, pp. 30\u201334 (2011)."},{"key":"647_CR13","unstructured":"Patterson D.A., Gibson G., Katz R.H.: A case for Redundant Arrays of Inexpensive Disks (RAID). In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 109\u2013116. Chicago, USA (1988)."},{"issue":"8","key":"647_CR14","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi K.V., Shah N.B., Kumar P.V.: Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inf. Theory 57(8), 5227\u20135239 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"647_CR15","doi-asserted-by":"crossref","unstructured":"Raviv N., Etzion T.: Distributed storage systems based on intersecting subspace codes. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 1462\u20131466. Hong Kong (2015).","DOI":"10.1109\/ISIT.2015.7282698"},{"issue":"4","key":"647_CR16","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1109\/TIT.2017.2658660","volume":"63","author":"N Raviv","year":"2017","unstructured":"Raviv N., Silberstein N., Etzion T.: Constructions of high-rate minimum storage regenerating codes over small fields. IEEE Trans. Inf. Theory 63(4), 2015\u20132038 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"647_CR17","doi-asserted-by":"crossref","unstructured":"Sahraei S., Gastpar M.: Increasing availability in distributed storage systems via clustering. In: 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA. June 2018. arXiv:1710.02653 .","DOI":"10.1109\/ISIT.2018.8437639"},{"key":"647_CR18","doi-asserted-by":"crossref","unstructured":"Shum K.W., Hu Y.: Functional-repair-by-transfer regenerating codes. In: 2012 IEEE International Symposium on Information Theory, pp. 1192\u20131196. Cambridge (2012).","DOI":"10.1109\/ISIT.2012.6283043"},{"key":"647_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-319-17296-5_36","volume-title":"Coding Theory and Applications","author":"Natalia Silberstein","year":"2015","unstructured":"Silberstein N.: Fractional repetition and erasure batch codes. In: Pinto R., Rocha Malonek P., Vettori P. (eds.) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham (2015)."},{"key":"647_CR20","doi-asserted-by":"crossref","unstructured":"Silberstein N., Etzion T.: Optimal fractional repetition codes and fractional repetition batch codes. In: 2015 IEEE International Symposium on Information Theory, pp. 2046\u20132050. Hong Kong (2015).","DOI":"10.1109\/ISIT.2015.7282815"},{"key":"647_CR21","doi-asserted-by":"crossref","unstructured":"Silberstein N., Etzion T., Schwartz M.: Locality and availability of array codes constructed from subspaces. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 829\u2013833. Aachen (2017).","DOI":"10.1109\/ISIT.2017.8006644"},{"issue":"5","key":"647_CR22","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/JSAC.2014.140519","volume":"32","author":"K Shanmugam","year":"2014","unstructured":"Shanmugam K., Papailiopoulos D.S., Dimakis A.G., Caire G.: A repair framework for scalar MDS codes. IEEE J. Sel. Areas Commun. 32(5), 998\u20131007 (2014).","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"647_CR23","unstructured":"Sohn J., Choi B., Moon J.: A class of MSR codes for clustered distributed storage. 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA. (2018). arXiv:1801.02014 ."},{"key":"647_CR24","unstructured":"Vajha M., Babu B.S., Kumar P.V.: Explicit MSR codes with optimal access, optimal sub-packetization and small field size for $$d=k+1$$, $$k+2$$, $$k+3$$. In: 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA (2018). arXiv:1804.00598 ."},{"key":"647_CR25","unstructured":"Westerb\u00e4ck T., Ernvall T., Hollanti C.: Almost affine locally repairable codes and matroid theory. In: 2014 IEEE Information Theory Workshop (ITW 2014), pp. 621\u2013625. Hobart, TAS (2014)."},{"issue":"10","key":"647_CR26","doi-asserted-by":"publisher","first-page":"5296","DOI":"10.1109\/TIT.2016.2598149","volume":"62","author":"T Westerb\u00e4ck","year":"2016","unstructured":"Westerb\u00e4ck T., Freij-Hollanti R., Ernvall T., Hollanti C.: On the combinatorics of locally repairable codes via matroid theory. IEEE Trans. Inf. Theory 62(10), 5296\u20135315 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"647_CR27","unstructured":"Ye M., Barg A.: Cooperative repair: Constructions of optimal MDS codes for all admissible parameters. In: 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA (2018). arXiv:1801.09665 ."},{"key":"647_CR28","unstructured":"Zorgui M., Wang Z.: On the achievability region of regenerating codes for multiple erasures. In: 2018 IEEE International Symposium on Information Theory (ISIT), Vail, Colorado, USA (2018). arXiv:1802.00104 ."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00647-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00647-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00647-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T17:49:00Z","timestamp":1721324940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00647-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,27]]},"references-count":28,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00647-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,27]]},"assertion":[{"value":"21 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}