Martin Schulze, et al, How Reliable is a Raid, 1989 IEEE p. 118-123. |
H.C. Ferreira and S. Lin, Error and Erasure Control. (d,k) Block Codes, IEEE Transactions on Information Theory, vol. 37, No. 5, Sep. 1991, p. 1399-1408. |
Alexander Barg and Shiyu Zhou, Linear-Time Binary Codes Correcting Localized Erasures, IEEE Transactions on Information Theory, vol. 45, No. 7, Nov. 1999, p. 2547-2557. |
Patrick Stevens, Error-Erasure Decoding of Binary Cyclic Codes, US to a Particular Instance of the Hartmann-Tzeng Bound, IEEE Transactions on Information Theory, vol. 36, No. 5, Sep. 1990, p. 1144-1149. |
Noga Alon and Michael Luby, A Linear Time Erasue-Resilient Code with Nearly Optimal Recovery, IEEE Transactions on Information Theory, vol. 42, No. 6, Nov. 1996, p. 1732-1736. |
Noga Alon et al, Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract), 1995 IEEE. |
Norifumi Kamiya, On Acceptance Criterion for Efficient Successive Errors-and-Erasures Decoding of Reed-Solomon and BCH Codes, IEEE Transactions on Information Theory, vol. 43, No. 5, Sep. 1997, p. 1477-1487. |
Shojiro Sakata et al, Fast Erasure-and-Error Decoding of Algebraic Geometry Codes Up to the Feng-Rao Bound, IEEE Transactions on Information Theory, vol. 44, No. 4, Jul. 1998, p. 1558-1564. |
Osnat Keren and Simon Litsyn, A Class of Array Codes Correcting Multiple Column Erasures, IEEE Transactions on Information Theory, vol. 43, No. 6, Nov. 1997, p. 1843-1851. |
Osnat Keren, Codes Correcting Phased Burst Erasures, IEEE Transactions on Information Theory, vol. 44, No. 1, Jan. 1998, p. 416-420. |
Flaminio Borgonovo et al, Comparison of Different Error Control Schemes OFR Wirless ATM, 1999 IEEE, p. 416-420. |
W van der Walt and HC Ferreira, Security of Levenshtein Synchronization Error Correcting Codes, 1994 IEEE, p. 466-470. |
Bharat Bhargava et al, Implementing Object Support in the Raid Distributed Database System, 1990 IEEE, p. 81-84. |
Yiqing Huang et al, Dependaility Analysis of a Cache-Based Raid System via Fast Distributed Simulation, 1998 IEEE, p. 268-277. |
L. Newberg and D. Wolfe, String Layouts for a Redundant Array of Inexpensive Disks, p. 254-260. |
Bharat Bhargava et al, Communication in the Raid Distributed Database System, 1990 IEEE, p. 400-407. |
Jong-Hoon Kim et al, An Efficient Caching Scheme for Software Raid File Systems in Workstation Clusters, 1997 IEEE, p. 331-336. |
H. Jayaram et al, The Impact of Smart Disks and Spatial Reuse Property on Raid-5 Storage Systems, 1998 IEEE, p. 21-28. |
Michael G. Luby, Analysis of Random Processes Via and-or Tree Evaluation, p. 1-15. |
Norifumi Kamiya, On Acceptance Criterion for Efficient Successive Errors-and-Erasures Decoding of Reed-Solomon and BCH Codes, IEEE Transactions on Information Theory, vol. 43, No. 5, Sep. 1997, p. 1477-1487. |
H.C. Ferreira and S. Lin, Error and Erasure Conrol (d,K) Block Codes, IEEE Transactions on Information Theory, vol. 37, No. 5, Sep. 1991, p. 1399-1408. |
Michael Luby, Practical Lose-Resilient Codes, p. 1-18. |