{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T02:34:26Z","timestamp":1773282866787,"version":"3.50.1"},"publisher-location":"London","reference-count":23,"publisher":"Springer London","isbn-type":[{"value":"9781852336424","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0110096","type":"book-chapter","created":{"date-parts":[[2007,10,2]],"date-time":"2007-10-02T12:56:44Z","timestamp":1191329804000},"page":"307-330","source":"Crossref","is-referenced-by-count":9,"title":["Highly available distributed storage systems"],"prefix":"10.1007","author":[{"given":"Lihao","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0012-365X(77)90126-1","volume":"18","author":"B. A. Anderson","year":"1977","unstructured":"B. A. Anderson, \u201cSymmetry Groups of Some Perfect 1-Factorizations of Complete Graphs,\u201d Discrete Mathematics, 18, 227\u2013234, 1977.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/12.364531","volume":"44","author":"M. Blaum","year":"1995","unstructured":"M. Blaum, J. Brady, J. Bruck and J. Menon, \u201cEVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures,\u201d IEEE Trans. on Computers, 44(2), 192\u2013202, Feb. 1995.","journal-title":"IEEE Trans. on Computers"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/18.485722","volume":"42","author":"M. Blaum","year":"1996","unstructured":"M. Blaum, J. Bruck, A. Vardy, \u201cMDS Array Codes with Independent Parity Symbols,\u201d IEEE Trans. on Information Theory, 42(2), 529\u2013542, March 1996.","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR4","unstructured":"M. Blaum, P. G. Farrell and H. C. A. van Tilborg, \u201cChapter on Array Codes\u201d, Handbook of Coding Theory, edited by V. S. Pless and W. C. Huffman, to appear."},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/18.179343","volume":"39","author":"M. Blaum","year":"1993","unstructured":"M. Blaum, R. M. Roth, \u201cNew Array Codes for Multiple Phased Burst Correction,\u201d IEEE Trans. on Information Theory, 39(1), 66\u201377, Jan. 1993.","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR6","unstructured":"V. Bohossian, C. Fan, P. LeMahieu, M. Riedel, L. Xu and J. Bruck, \u201cComputing in the RAIN: A Reliable Array of Independent Nodes\u201d, Caltech Technical Report, 1998. Available at: http:\/\/paradise.caltech.edu\/papers\/etr029.ps."},{"key":"22_CR7","unstructured":"M. N. Frank, \u201cDispersity Routing in Store-and-Forward Networks,\u201d Ph.D. thesis, University of Pennsylvania, 1975."},{"issue":"5","key":"22_CR8","first-page":"441","volume":"3","author":"P. G. Farrell","year":"1992","unstructured":"P. G. Farrell, \u201cA Survey of Array Error Control Codes,\u201d ETT, 3(5), 441\u2013454, 1992.","journal-title":"ETT"},{"key":"22_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R. G. Gallager","year":"1963","unstructured":"R. G. Gallager, \u201cLow-Density Parity-Check Codes,\u201d MIT Press, Cambridge, Massachusetts, 1963."},{"key":"22_CR10","unstructured":"J. Gemmell, \u201cScalable Reliable Multicast Using Erasuring-Correcting Re-Sends,\u201d Technical Report MSR-TR-97-20, Microsoft Research, June, 1997."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/18.212304","volume":"39","author":"R. M. Goodman","year":"1993","unstructured":"R. M. Goodman, R. J. McEliece and M. Sayano, \u201cPhased Burst Error Correcting Arrays Codes,\u201d IEEE Trans. on Information Theory, 39, 684\u2013693, 1993.","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR12","unstructured":"A. Kotzig, \u201cHamilton Graphs and Hamilton Circuits,\u201d Theory of Graphs and Its Applications (Proc. Sympos. Smolenice), 63\u201382, 1963."},{"key":"22_CR13","volume-title":"The Theory of Error Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, Amsterdam: North-Holland, 1977."},{"key":"22_CR14","unstructured":"Norman K. Ouchi, \u201cSystem for Recovering Data Stored in Failed Memory Unit,\u201d US Patent 4092732, May 30, 1978."},{"key":"22_CR15","unstructured":"A. Papoulis, Probability, Random Variables, and Stochastic Processes, 2nd Edition, McGraw-Hill, Inc., 1984."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"D. A. Patterson, G. A. Gibson and R. H. Katz, \u201cA Case for Redundant Arrays of Inexpensive Disks,\u201d Proc. SIGMOD Int. Conf. Data Management, 109\u2013116, Chicago, IL, 1988.","DOI":"10.1145\/50202.50214"},{"issue":"5","key":"22_CR17","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R. M. Tanner","year":"1981","unstructured":"R. M. Tanner, \u201cA Recursive Approach to Low Complexity Codes,\u201d IEEE Trans. on Information Theory, 27(5), 533\u2013547, Sep. 1981.","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(92)90337-F","volume":"104","author":"D. G. Wagner","year":"1992","unstructured":"D. G. Wagner, \u201cOn the Perfect One-Factorization Conjecture,\u201d Discrete Mathematics, 104, 211\u2013215, 1992.","journal-title":"Discrete Mathematics"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"W. D. Wallis, One-Factorizations, Kluwer Academic Publisher, 1997.","DOI":"10.1007\/978-1-4757-2564-3"},{"key":"22_CR20","unstructured":"Samuel S. Wilks, Mathematical Statistics, John Wiley & Sons, Inc., 1963."},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/18.746809","volume":"45","author":"L. Xu","year":"1999","unstructured":"L. Xu and J. Bruck, \u201cX-Code: MDS Array Codes with Optimal Encoding,\u201d IEEE Trans. on Information Theory, 45(1), 272\u2013276, Jan., 1999. Also available at: http:\/\/paradise.caltech.edu\/papers\/etr020.ps.","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR22","unstructured":"L. Xu, V. Bohossian, J. Bruck and D. Wagner, \u201cLow Density MDS Codes and Factors of Complete Graphs,\u201d Proceedings of 1998 IEEE Symposium on Information Theory, Aug., 1998; Revised version to appear in IEEE Trans. on Information Theory, Sep. 1999. Also available at: http:\/\/paradise.caltech.edu\/papers\/etr025.ps."},{"key":"22_CR23","unstructured":"L. Xu, \u201cHighly Available Distributed Storage Systems,\u201d Ph.D. thesis, California Institute of Technology, 1998. Also available at: http:\/\/paradise.caltech.edu\/\u223clihao\/thesis.html."}],"container-title":["Lecture Notes in Control and Information Sciences","Workshop on wide area networks and high performance computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0110096.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:02:01Z","timestamp":1607551321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0110096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781852336424"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0110096","relation":{},"subject":[]}}