{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:36:36Z","timestamp":1772807796142,"version":"3.50.1"},"reference-count":43,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2020]]},"DOI":"10.3934\/amc.2020024","type":"journal-article","created":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T04:42:21Z","timestamp":1568263341000},"page":"333-357","source":"Crossref","is-referenced-by-count":3,"title":["Linear programming bounds for distributed storage codes"],"prefix":"10.3934","volume":"14","author":[{"given":"Ali","family":"Tebbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terence","family":"Chan","sequence":"additional","affiliation":[{"name":"Institute for Telecommunications Research, University of South Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi Wan","family":"Sung","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, City University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020024-1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800042"},{"key":"key-10.3934\/amc.2020024-2","unstructured":"<p>R. Bhagwan, K. Tati, S. S. Y. Cheng and G. Voelker, Total recall: System support for automated availability management, in <i>Proc. NSDI '04<\/i>.<\/p>"},{"key":"key-10.3934\/amc.2020024-3"},{"key":"key-10.3934\/amc.2020024-4"},{"key":"key-10.3934\/amc.2020024-5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"key-10.3934\/amc.2020024-6","doi-asserted-by":"crossref","unstructured":"<p>W. J. Bolosky, J. R. Douceur, D. Ely and M. Theimer, Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs, in <i>Proc. of Sigmetrics<\/i>, <b>28<\/b> (2000), 34\u201343.<\/p>","DOI":"10.1145\/345063.339345"},{"key":"key-10.3934\/amc.2020024-7","doi-asserted-by":"crossref","unstructured":"<p>V. R. Cadambe and A. Mazumdar, An upper bound on the size of locally recoverable codes, in <i>Proc. Int. Symp. Network Coding (NetCod)<\/i>, Calgary, AB, (2013), 1\u20135.<\/p>","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"key-10.3934\/amc.2020024-8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"key-10.3934\/amc.2020024-9"},{"key":"key-10.3934\/amc.2020024-10","doi-asserted-by":"crossref","unstructured":"<p>T. H. Chan, M. A. Tebbi and C. W. Sung, Linear programming bounds for storage codes, in <i>9th International Conference on Information, Communication, and Signal Processing (ICICS 2013)<\/i>, (2013).<\/p>","DOI":"10.1109\/ICICS.2013.6782924"},{"key":"key-10.3934\/amc.2020024-11","doi-asserted-by":"crossref","unstructured":"<p>B. Chen, S.-T. Xia and J. Hao, Locally repairable codes with multiple $(r_i, \\delta_i)$-localities, in <i>IEEE Int. Symp. Information Theory (ISIT)<\/i>, Aachen, Germany, (2017), 2038\u20132042.<\/p>","DOI":"10.1109\/ISIT.2017.8006887"},{"key":"key-10.3934\/amc.2020024-12","doi-asserted-by":"crossref","unstructured":"<p>Y. Chen, J. Edler, A. Goldberg, S. Sobti and P. Yianilos, A prototype implementation of archival intermemory, in <i>DL '99 Proceedings of the Fourth ACM Conference on Digital Libraries<\/i>, (1999), 28\u201337.<\/p>","DOI":"10.1145\/313238.313249"},{"key":"key-10.3934\/amc.2020024-13"},{"key":"key-10.3934\/amc.2020024-14","unstructured":"<p>P. Druschel and A. Rowstron, Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility, in <i>Proc. of ACM SOSP<\/i>, (2001).<\/p>"},{"key":"key-10.3934\/amc.2020024-15","doi-asserted-by":"crossref","unstructured":"<p>R. Gabrys, E. Yaakobi, M. Blaum and P. H. Siegel, Constructions of partial MDS codes over small fields, in <i>IEEE International Symposium on Information Theory<\/i>, <b>65<\/b> (2019), 3692\u20133701.<\/p>","DOI":"10.1109\/TIT.2018.2890201"},{"key":"key-10.3934\/amc.2020024-16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"key-10.3934\/amc.2020024-17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"key-10.3934\/amc.2020024-18","doi-asserted-by":"crossref","unstructured":"<p>C. Huang, M. H. Chen and J. Li, <i>Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems<\/i>, Technical Report MSR-TR-2007-25, Microsoft Research, 2007.<\/p>","DOI":"10.1109\/NCA.2007.37"},{"key":"key-10.3934\/amc.2020024-19","doi-asserted-by":"crossref","unstructured":"<p>S. Kadhe and A. Sprintson, Codes with unequal locality, in <i>IEEE Int. Symp. Information Theory (ISIT)<\/i>, Barcelona, Spain, (2016), 435\u2013439.<\/p>","DOI":"10.1109\/ISIT.2016.7541336"},{"key":"key-10.3934\/amc.2020024-20","doi-asserted-by":"crossref","unstructured":"<p>S. Kadhe and R. Calderbank, Rate optimal binary linear locally repairable codes with small availability, in <i>IEEE Int. Symp. Information Theory<\/i>, Aachen, Germany, (2017), 166\u2013170.<\/p>","DOI":"10.1109\/ISIT.2017.8006511"},{"key":"key-10.3934\/amc.2020024-21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"key-10.3934\/amc.2020024-22","unstructured":"<p>O. Khan, R. Burns, J. Park and C. Huang, In search of I\/O-optimal recovery from disk failures, in <i>Proceedings of the 3rd USENIX Conference on Hot Topics in Storage and File Systems<\/i>, HotStorage'11, USENIX Association, Berkeley, CA, USA, (2011), 6\u20136, URL <a href=\"http:\/\/dl.acm.org\/citation.cfm?id=2002218.2002224\" target=\"_blank\">http:\/\/dl.acm.org\/citation.cfm?id=2002218.2002224<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020024-23","doi-asserted-by":"crossref","unstructured":"<p>J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells and B. Zhao, OceanStore: An architecture for global-scale persistent storage, in <i>Proc. 9th Int. Conf. Architectural Support Programm. Lang. Oper. Syst.<\/i>, Boston, MA, (2000), 190\u2013201.<\/p>","DOI":"10.1145\/378993.379239"},{"key":"key-10.3934\/amc.2020024-24","unstructured":"<p>F. J. Macwilliams and N. J. A. Sloane, <i>The Theory of Error Correcting Codes. I.<\/i>, North-Holland Mathematical Library, Vol. 16. North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977.<\/p>"},{"key":"key-10.3934\/amc.2020024-25","doi-asserted-by":"crossref","unstructured":"<p>U. Martnez-Penas and F. R. Kschischang, Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes, in <i>2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)<\/i>, IEEE, (2018), 792\u2013799.<\/p>","DOI":"10.1109\/ALLERTON.2018.8635867"},{"key":"key-10.3934\/amc.2020024-26","doi-asserted-by":"crossref","unstructured":"<p>F. Oggier and A. Datta, Self-repairing homomorphic codes for distributed storage systems, in <i>proc. IEEE INFOCOM<\/i>, (2011), 1251\u20131223.<\/p>","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"key-10.3934\/amc.2020024-27","doi-asserted-by":"crossref","unstructured":"<p>L. Pamies-Juarez, H. D. L. Hollmann and F. Oggier, Locally repairable codes with multiple repair alternatives, in <i>IEEE Int. Symp. Information Theory<\/i>, (2013), 892\u2013896.<\/p>","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"key-10.3934\/amc.2020024-28","doi-asserted-by":"crossref","unstructured":"<p>D. S. Papailiopoulos and A. G. Dimakis, Locally repairable codes, in <i>IEEE Trans. Inform. Theory<\/i>, <b>60<\/b> (2014), 5843\u20135855.<\/p>","DOI":"10.1109\/TIT.2014.2325570"},{"key":"key-10.3934\/amc.2020024-29","doi-asserted-by":"crossref","unstructured":"<p>D. S. Papailiopoulos, J. Q. Luo, A. G. Dimakis, C. Huang and J. Li, Simple regenerating codes: Network coding for cloud storage, in <i>proc. IEEE INFOCOM<\/i>, (2012), 2801\u20132805.<\/p>","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"key-10.3934\/amc.2020024-30","unstructured":"<p>D. A. Patterson, G. Gibson and R. Katz, <i>A Case for Redundant Arrays of Inexpensive Disks RAID<\/i>, Tech. Rep. CSD-87-391, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA 94720, 1987.<\/p>"},{"key":"key-10.3934\/amc.2020024-31","doi-asserted-by":"crossref","unstructured":"<p>N. Prakash, V. Lalitha and P. V. Kumar, Codes with locality for two erasures, in <i>IEEE Int. Symp. Information Theory (ISIT)<\/i>, (2014), 1962\u20131966.<\/p>","DOI":"10.1109\/ISIT.2014.6875176"},{"key":"key-10.3934\/amc.2020024-32"},{"key":"key-10.3934\/amc.2020024-33","doi-asserted-by":"crossref","unstructured":"<p>A. S. Rawat, A. Mazumdar and S. Vishwanath, On cooperative local repair in distributed storage, in <i>48th Annual Conference on Information Sciences and Systems (CISS)<\/i>, (2014), 1\u20135.<\/p>","DOI":"10.1109\/CISS.2014.6814152"},{"key":"key-10.3934\/amc.2020024-34","doi-asserted-by":"crossref","unstructured":"<p>A. S. Rawat, D. S. Papailiopoulos, A. G. Dimakis and S. Vishwanath, Locality and availability in distributed storage, in <i>IEEE Trans. Inform. Theory<\/i>, <b>62<\/b> (2016), 4481\u20134493.<\/p>","DOI":"10.1109\/TIT.2016.2524510"},{"key":"key-10.3934\/amc.2020024-35","doi-asserted-by":"crossref","unstructured":"<p>S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon and J. Kubiatowicz, Maintenance free global storage in oceanstore, in <i>Poc. of IEEE Internet Computing<\/i>, (2001), 40\u201349.<\/p>","DOI":"10.1109\/4236.957894"},{"key":"key-10.3934\/amc.2020024-36","doi-asserted-by":"crossref","unstructured":"<p>I. Tamo and A. Barg, Bounds on locally recoverable codes with multiple recovering sets, in <i>IEEE International Symposium on Information Theory<\/i>, Honolulu, HI, (2014), 691\u2013695.<\/p>","DOI":"10.1109\/ISIT.2014.6874921"},{"key":"key-10.3934\/amc.2020024-37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"key-10.3934\/amc.2020024-38","doi-asserted-by":"crossref","unstructured":"<p>I. Tamo, D. Papailiopoulos and A. Dimakis, Optimal locally repairable codes and connections to matroid theory, in <i>IEEE Int. Symp. Information Theory<\/i>, Istanbul, (2013), 1814\u20131818.<\/p>","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"key-10.3934\/amc.2020024-39","doi-asserted-by":"crossref","unstructured":"<p>M. A. Tebbi, T. H. Chan and C. W. Sung, Linear programming bounds for robust locally repairable storage codes, in <i>IEEE Information Theory Workshop (ITW 2014)<\/i>, (2014), 50\u201354.<\/p>","DOI":"10.1109\/ITW.2014.6970790"},{"key":"key-10.3934\/amc.2020024-40","doi-asserted-by":"crossref","unstructured":"<p>A. Wang and Z. Zhang, Repair locality from a combinatorial perspective, in <i>IEEE Int. Symp. Information Theory<\/i>, (2014), 1972\u20131976.<\/p>","DOI":"10.1109\/ISIT.2014.6875178"},{"key":"key-10.3934\/amc.2020024-41","doi-asserted-by":"crossref","unstructured":"<p>H. Weatherspoon and J. D. Kubiatowicz, Erasure coding vs. replication: A quantitative comparison, in <i>Proc. Int. Workshop Peer-to-Peer Syst.<\/i>, (2002), 328\u2013337.<\/p>","DOI":"10.1007\/3-540-45748-8_31"},{"key":"key-10.3934\/amc.2020024-42","unstructured":"<p>S. B. Wicker, <i>Error Control Systems for Digital Communication and Storage<\/i>, Prentice Hall, Englewood Cliffs, NJ, 1995.<\/p>"},{"key":"key-10.3934\/amc.2020024-43","doi-asserted-by":"crossref","unstructured":"<p>A. Zeh and E. Yaakobi, Bounds and constructions of codes with multiple localities, in <i>IEEE Int. Symp. Information Theory (ISIT)<\/i>, Barcelona, Spain, (2016), 640\u2013644.<\/p>","DOI":"10.1109\/ISIT.2016.7541377"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=4cab2d0f-e418-4908-a52b-6da147e2edff","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:03:57Z","timestamp":1772791437000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2020024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2020024","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}