{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T17:02:44Z","timestamp":1793206964786,"version":"4.5.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/dsn.2004.1311882","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"115-124","source":"Crossref","is-referenced-by-count":73,"title":["A practical analysis of low-density parity-check erasure codes for wide-area storage applications"],"prefix":"10.1109","author":[{"given":"J.S.","family":"Plank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.G.","family":"Thomason","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref12","article-title":"Analysis of random processes via and-or tree evaluation","author":"luby","year":"0"},{"key":"ref13","first-page":"237","article-title":"Lb ${}^{{\\ast}}{\\rm rs}$: a high-availability scalable distributed data structure using Reed Solomon codes","author":"litwin","year":"0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref15","article-title":"Achieving the Shannon Limit: A progress report","author":"mceliece","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.1996.559700"},{"key":"ref17","author":"plank","year":"2003","journal-title":"GFLIB C Procedures for Galois Field Arithmetic and Reed Solomon Coding"},{"key":"ref18","article-title":"On the practical use of LDPC erasure codes for distributed storage applications","author":"plank","year":"2003","journal-title":"Technical Report CS-03–510"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228016"},{"key":"ref28","article-title":"Fundamentals of Codes, Graphs, and Iterative Decoding","author":"wicker","year":"2003"},{"key":"ref4","first-page":"56","article-title":"A digital fountain approach to reliable distribution of bulk data","author":"byers","year":"0"},{"key":"ref27","article-title":"Erasure coding vs. replication: A quantitative comparison","author":"weatherspoon","year":"0","journal-title":"Proc of the 1st Int Workshop on Peer-to-Peer Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749293"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/176979.176981"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2002.1180205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1993.627346"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-Density Parity-Check Codes","author":"gallager","year":"1963"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inform Thy"},{"key":"ref2","article-title":"The Livny and Plank-Beck Problems: Studies in data movement on the computational grid","author":"allen","year":"1995","journal-title":"SC2003 $[ \\rm BKK ^ + 95]$ J Blomer et al An XOR-based erasure-resilient coding scheme Tech Rep TR-95–048"},{"key":"ref9","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"0"},{"key":"ref1","article-title":"The Probabilistic Method","author":"alon","year":"1992"},{"key":"ref20","first-page":"40","article-title":"Modern coding theory. Draft from lthcwww.epfl.ch\/papers\/ics.ps, August $\/{\\rm papers}\/{\\rm ics}$. pS. August 2003. $[{\\rm RWE}^{+}01]$ S. Rhea Maintenanc ${\\rm e}\\hbox{-}{\\rm free}$ global data storage","volume":"5","author":"richardson","year":"2001","journal-title":"IEEE Internet Computing"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46541-3_1"},{"key":"ref21","first-page":"65","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"0","journal-title":"Proceedings of AAECC-13 Lecture Notes in CS 1719"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866295"},{"key":"ref23","article-title":"Raptorcodes","author":"shokrollahi","year":"2003","journal-title":"TechnicaIReportDR2003–06–001"},{"key":"ref26","author":"urbanke","year":"2003","journal-title":"LdcpOpt - a fast and accurate degree distribution optimizer for LPDC ensembles"},{"key":"ref25","article-title":"The Visual Display of Quantitative Information","author":"tufte","year":"1983"}],"event":{"name":"International Conference on Dependable Systems and Networks, 2004","location":"Florence, Italy","start":{"date-parts":[[2004,7,1]]},"end":{"date-parts":[[2004,7,1]]}},"container-title":["International Conference on Dependable Systems and Networks, 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9172\/29105\/01311882.pdf?arnumber=1311882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T01:40:31Z","timestamp":1585964431000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1311882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/dsn.2004.1311882","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}