{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T23:10:09Z","timestamp":1751238609562,"version":"3.41.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262864","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"1131-1138","source":"Crossref","is-referenced-by-count":1,"title":["Limitations of piggybacking codes with low substriping"],"prefix":"10.1109","author":[{"given":"Reyna","family":"Hulett","sequence":"first","affiliation":[]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2561287"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref14","first-page":"1","author":"shah","year":"2010","journal-title":"Explicit codes minimizing repair bandwidth for distributed Storage"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"10","DOI":"10.5486\/PMD.1963.10.1-4.02","article-title":"On a limit theorem in combinatorial analysis","volume":"10","author":"erd\u00f6s","year":"1963","journal-title":"Publicationes Mathematicae Debrecen"},{"journal-title":"New piggybacking design for systematic MDS storage codes","year":"2016","author":"shangguan","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472524"},{"key":"ref6","first-page":"216","author":"guruswami","year":"2016","journal-title":"Repairing reed-solomon codes"},{"key":"ref5","first-page":"1","author":"kumar","year":"2015","journal-title":"A family of erasure correcting codes with low repair bandwidth and low repair complexity"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref7","article-title":"A solution to the network challenges of data recovery in erasure coded storage systems: A study on the Facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"UNISEX Hotstorage"},{"key":"ref2","first-page":"331","author":"rashmi","year":"2013","journal-title":"A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes"},{"journal-title":"Limitations on the achievable repair bandwidth of piggybacking codes with low substriping","year":"2017","author":"hulett","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262864.pdf?arnumber=8262864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T22:42:14Z","timestamp":1751236934000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262864","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}