{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:11Z","timestamp":1772283611614,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319172958","type":"print"},{"value":"9783319172965","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17296-5_36","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T14:30:01Z","timestamp":1437748201000},"page":"335-343","source":"Crossref","is-referenced-by-count":6,"title":["Fractional Repetition and Erasure Batch Codes"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Silberstein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198500292.001.0001","volume-title":"Combinatorial Designs and Tournaments","author":"I. Anderson","year":"1997","unstructured":"Anderson, I.: Combinatorial Designs and Tournaments. Clarendon Press, Oxford (1997)"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3934\/amc.2012.6.165","volume":"3","author":"S. Bhattacharya","year":"2012","unstructured":"Bhattacharya, S., Ruj, S., Roy, B.K.: Combinatorial batch codes: a lower bound and optimal constructions. Adv. Math. Commun. 3(1), 165\u2013174 (2012). doi:10.3934\/amc.2012.6.165","journal-title":"Adv. Math. Commun."},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.3934\/amc.2011.5.529","volume":"5","author":"C. Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Optimal batch codes: Many items or low retrieval requirement. Adv. Math. Commun. 5(3), 529\u2013541 (2011). doi:10.3934\/amc.2011.5.529","journal-title":"Adv. Math. Commun."},{"issue":"9","key":"36_CR4","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"A. Dimakis","year":"2010","unstructured":"Dimakis, A., Godfrey, P., Wu, Y., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010). doi:10.1109\/TIT.2010.2054295","journal-title":"IEEE Trans. Inf. Theory"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"A.G. Dimakis","year":"2011","unstructured":"Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. Proc. IEEE 99, 476\u2013489 (2011)","journal-title":"Proc. IEEE"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"El\u00a0Rouayheb, S., Ramchandran, K.: Fractional repetition codes for repair in distributed storage systems. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Urbana-Champaign, pp.\u00a01510\u20131517 (2010)","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Proceedings of the 36th Annual ACM Symposium on the Theory of computing (STOC\u201904), Chicago, pp.\u00a0262\u2013271 (2004). doi:10.1145\/1007352.1007396","DOI":"10.1145\/1007352.1007396"},{"key":"36_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1978","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1978)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Olmez, O., Ramamoorthy, A.: Repairable replication-based storage systems using resolvable designs. In: Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, pp.\u00a01174\u20131181 (2012). doi:10.1109\/Allerton.2012.6483351","DOI":"10.1109\/Allerton.2012.6483351"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3934\/amc.2009.3.13","volume":"3","author":"M.B. Paterson","year":"2009","unstructured":"Paterson, M.B., Stinson, D.R., Wei, R.: Combinatorial batch codes. Adv. Math. Commun. 3(1), 13\u201327 (2009). doi:10.3934\/amc.2009.3.13","journal-title":"Adv. Math. Commun."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Pawar, S., Noorshams, N., El\u00a0Rouayheb, S., Ramchandran, K.: Dress codes for the storage cloud: simple randomized constructions. In: Proceedings of the 2011 IEEE International Symposium on Information Theory (ISIT 2011), St. Petersburg, pp.\u00a02338\u20132342 (2011). doi:10.1109\/ISIT.2011.6033980","DOI":"10.1109\/ISIT.2011.6033980"},{"issue":"8","key":"36_CR12","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"K.V. Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N., Kumar, P.: 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). doi:10.1109\/TIT.2011.2159049","journal-title":"IEEE Trans. Inf Theory"},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1109\/TIT.2011.2173792","volume":"58","author":"N. Shah","year":"2012","unstructured":"Shah, N., Rashmi, K.V., Kumar, P., Ramchandran, K.: Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff. IEEE Trans. Inf. Theory 58(3), 1837\u20131852 (2012). doi:10.1109\/TIT.2011.2173792","journal-title":"IEEE Trans. Inf. Theory"},{"key":"36_CR14","unstructured":"Silberstein, N., Etzion, T.: Optimal fractional repetition codes (2014). arXiv:1401.4734"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Silberstein, N., G\u00e1l, A.: Optimal combinatorial batch codes based on block designs (2013). Accepted for publication in Designs, Codes and Cryptography (Springer) http:\/\/dx.doi:10.1007\/s10623-014-0007-9","DOI":"10.1007\/s10623-014-0007-9"}],"container-title":["CIM Series in Mathematical Sciences","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17296-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T05:09:38Z","timestamp":1717996178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17296-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319172958","9783319172965"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17296-5_36","relation":{},"ISSN":["2364-950X","2364-9518"],"issn-type":[{"value":"2364-950X","type":"print"},{"value":"2364-9518","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}