Differences
This shows you the differences between two versions of the page.
|
wiki:papers:all [2012/08/02 02:09] kenneth |
wiki:papers:all [2013/06/13 04:53] (current) pclee |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== List of All Papers ====== | ====== List of All Papers ====== | ||
| + | |||
| + | ===== Coded Storage System Implementations ===== | ||
| + | * Papers in reverse chronological order | ||
| + | ---- | ||
| + | |||
| + | == XORing Elephants: Novel Erasure Codes for Big Data == | ||
| + | |||
| + | Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur\\ | ||
| + | VLDB 2013\\ | ||
| + | [[http://arxiv.org/abs/1301.3791|arXiv]]\\ | ||
| + | [[http://smahesh.com/HadoopUSC/|Xorbas project webpage]] (source code available for download) | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems == | ||
| + | |||
| + | Runhui Li, Jian Lin, Patrick P. C. Lee\\ | ||
| + | 29th IEEE Conference on Massive Data Storage (MSST 2013) (Short paper), Long Beach, CA, May 2013\\ | ||
| + | [[http://www.cse.cuhk.edu.hk/~pclee/www/pubs/msst13.pdf|pdf]] | ||
| + | [[http://www.cse.cuhk.edu.hk/~pclee/www/pubs/msst13.pptx|pptx]] | ||
| + | [[http://arxiv.org/abs/1302.3344|arXiv]] | ||
| + | [[http://ansrlab.cse.cuhk.edu.hk/software/core|software]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Erasure coding in Windows Azure Storage == | ||
| + | |||
| + | Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, Sergey Yekhanin\\ | ||
| + | [[http://research.microsoft.com/en-us/um/people/yekhanin/Papers/UsenixATC_2012.pdf|USENIX ATX 2012]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == NCCloud: Applying Network Coding for the Storage Repair in a Cloud-of-Clouds == | ||
| + | Y. Hu, H.C.H. Chen, P.P.C. Lee and Y. Tang\\ | ||
| + | FAST 2012.\\ | ||
| + | [[http://www.cse.cuhk.edu.hk/~pclee/www/pubs/fast12.pdf|pdf]] | ||
| + | [[http://www.cse.cuhk.edu.hk/~pclee/www/pubs/fast12.pptx|pptx]] | ||
| + | [[http://ansrlab.cse.cuhk.edu.hk/software/nccloud/|software]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | |||
| + | ===== Queueing-theoretic analysis of Coded Distributed Storage ===== | ||
| + | |||
| + | * Papers in reverse chronological order | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == The MDS Queue == | ||
| + | |||
| + | Nihar B. Shah, Kangwook Lee, Kannan Ramchandran\\ | ||
| + | [[http://arxiv.org/abs/1211.5405|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Toward Sustainable Networking: Storage Area Networks with Network Coding == | ||
| + | |||
| + | Ulric J. Ferner, Muriel Medard, Emina Soljanin\\ | ||
| + | [[http://arxiv.org/abs/1205.3797|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Coding for Fast Content Download == | ||
| + | |||
| + | Gauri Joshi, Yanpei Liu, Emina Soljanin\\ | ||
| + | [[http://arxiv.org/abs/1210.3012|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Codes Can Reduce Queueing Delay in Data Centers == | ||
| + | |||
| + | Longbo Huang, Sameer Pawar, Hao Zhang, Kannan Ramchandran\\ | ||
| + | [[http://arxiv.org/abs/1202.1359|arXiv]]\\ | ||
| + | |||
| + | ===== Surveys ===== | ||
| + | |||
| + | * Papers in Reverse Chronological Order | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Data Insertion & Archiving in Erasure-coding Based Large-scale Storage Systems == | ||
| + | |||
| + | Lluis Pamies-Juarez, Frédérique Oggier, Anwitaman Datta \\ | ||
| + | Paper accompanying invited talk at International Conference on Distributed Computing and Internet Technologies (ICDCIT 2013)\\ | ||
| + | [[http://sands.sce.ntu.edu.sg/CodingForNetworkedStorage/pdf/icdcit13.pdf]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Coding Techniques for Repairability in Networked Distributed Storage Systems == | ||
| + | |||
| + | Frederique Oggier, Anwitaman Datta \\ | ||
| + | [[http://sands.sce.ntu.edu.sg/CodingForNetworkedStorage/pdf/longsurvey.pdf]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == An Overview of Codes Tailor-made for Networked Distributed Data Storage == | ||
| + | |||
| + | Anwitaman Datta, Frederique Oggier \\ | ||
| + | [[http://arxiv.org/abs/1109.2317| arXiv]] | ||
| + | |||
| + | ---- | ||
| + | == A Survey on Network Codes for Distributed Storage == | ||
| + | |||
| + | A. G. Dimakis, K. Ramchandran, Y. Wu, C. Suh, \\ | ||
| + | Proceedings of the IEEE, March 2011, Vol 99, No 3. | ||
| + | [[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5709963| IEEEXplore]] | ||
| ===== Repairing Distributed Storage Systems ===== | ===== Repairing Distributed Storage Systems ===== | ||
| Line 6: | Line 112: | ||
| * General introduction to the [[wiki:definitions:Repair Problem|Repair Problem]]. | * General introduction to the [[wiki:definitions:Repair Problem|Repair Problem]]. | ||
| + | |||
| + | ---- | ||
| + | == A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes == | ||
| + | K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran\\ | ||
| + | [[http://arxiv.org/pdf/1302.5872.pdf|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | == On Minimizing Data-read and Download for Storage-Node Recovery == | ||
| + | Nihar B. Shah\\ | ||
| + | [[http://www.eecs.berkeley.edu/~nihar/publications/mbr_no_rbt.pdf|Online]] | ||
| + | |||
| + | ---- | ||
| + | == Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes == | ||
| + | J. Chen, Kenneth W. Shum\\ | ||
| + | [[http://arxiv.org/abs/1302.1256|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs == | ||
| + | C Tian, V Aggarwal, VA Vaishampayan\\ | ||
| + | [[http://arxiv.org/pdf/1302.4670.pdf|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == On Weak Dress Codes for Cloud Storage == | ||
| + | MK Gupta, A Agrawal, D Yadav\\ | ||
| + | [[http://arxiv.org/pdf/1302.3681.pdf|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == High-Rate Regenerating Codes Through Layering == | ||
| + | B Sasidharan, PV Kumar\\ | ||
| + | [[http://arxiv.org/pdf/1301.6157.pdf|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Repair for Distributed Storage Systems with Erasure Channels == | ||
| + | |||
| + | Majid Gerami, and Ming Xiao\\ | ||
| + | [[http://arxiv.org/abs/1301.7054|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Decentralized Minimum-Cost Repair for Distributed Storage Systems == | ||
| + | |||
| + | Majid Gerami, Ming Xiao, Carlo Fischione, and Mikael Skoglund\\ | ||
| + | [[http://arxiv.org/abs/1301.7265|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Update-Efficient Error-Correcting Regenerating Codes == | ||
| + | |||
| + | Yunghsiang S. Han, Hong-Ta Pai, Rong Zheng, and Pramod K. Varshney\\ | ||
| + | [[http://arxiv.org/abs/1301.4620|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Update-Efficient Regenerating Codes with Minimum Per-Node Storage == | ||
| + | |||
| + | Yunghsiang S. Han, Hong-Ta Pai, Rong Zheng, and Pramod K. Varshney\\ | ||
| + | [[http://arxiv.org/abs/1301.2497|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Optimal Locally Repairable and Secure Codes for Distributed Storage Systems == | ||
| + | |||
| + | Ankit Singh Rawat, O. Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath\\ | ||
| + | [[http://arxiv.org/abs/1210.6954|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Secure Cooperative Regenerating Codes for Distributed Storage Systems == | ||
| + | |||
| + | O. Ozan Koyluoglu, Ankit Singh Rawat, Sriram Vishwanath\\ | ||
| + | [[http://arxiv.org/abs/1210.3664|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems == | ||
| + | |||
| + | Yuchong Hu, Patrick P. C. Lee, Kenneth W. Shum\\ | ||
| + | Proceedings of IEEE INFOCOM 2013\\ | ||
| + | [[http://arxiv.org/abs/1208.2787|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Quasi-cyclic Regenerating Codes == | ||
| + | |||
| + | Bernat Gastón, Jaume Pujol, Mercè Villanueva | ||
| + | |||
| + | [[http://arxiv.org/abs/1209.3977|arXiv]]\\ | ||
| ---- | ---- | ||
| Line 149: | Line 346: | ||
| [[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5934689&tag=1| IEEEXplore download]]\\ | [[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5934689&tag=1| IEEEXplore download]]\\ | ||
| [[papers:Selective Regenerating Codes |More]] \\ | [[papers:Selective Regenerating Codes |More]] \\ | ||
| - | |||
| - | ---- | ||
| - | |||
| - | == An Overview of Codes Tailor-made for Networked Distributed Data Storage == | ||
| - | |||
| - | Anwitaman Datta, Frederique Oggier \\ | ||
| - | [[http://arxiv.org/abs/1109.2317]] | ||
| - | |||
| ---- | ---- | ||
| Line 263: | Line 452: | ||
| [[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749461| IEEEXplore download]]\\ | [[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749461| IEEEXplore download]]\\ | ||
| [[papers:Quasi-cyclic Minimum Storage Regenerating Codes for Distributed Data Compression |More]] \\ | [[papers:Quasi-cyclic Minimum Storage Regenerating Codes for Distributed Data Compression |More]] \\ | ||
| - | |||
| - | ---- | ||
| - | == A Survey on Network Codes for Distributed Storage == | ||
| - | |||
| - | A. G. Dimakis, K. Ramchandran, Y. Wu, C. Suh, \\ | ||
| - | Proceedings of the IEEE, March 2011, Vol 99, No 3. | ||
| - | [[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5709963| IEEEXplore]] | ||
| - | |||
| - | [[papers:A Survey on Network Codes for Distributed Storage|More]] | ||
| Line 402: | Line 582: | ||
| [[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5487686|IEEE Xplore]] \\ | [[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5487686|IEEE Xplore]] \\ | ||
| [[papers:A Practical Network Coding Approach for Peer-to-Peer Distributed Storage|More]] | [[papers:A Practical Network Coding Approach for Peer-to-Peer Distributed Storage|More]] | ||
| - | ---- | ||
| - | |||
| - | == A Survey on Network Codes for Distributed Storage == | ||
| - | Alexandros G. Dimakis, Kannan Ramchandran, Yunnan Wu, Changho Suh \\ | ||
| - | Status: Invited, The Proceedings of the IEEE. \\ | ||
| - | [[http://arxiv.org/pdf/1004.4438v1 |Arxiv]]\\ | ||
| - | [[papers:A Survey on Network Codes for Distributed Storage|More]] | ||
| ---- | ---- | ||
| Line 542: | Line 715: | ||
| ===== Erasure coding for storage ===== | ===== Erasure coding for storage ===== | ||
| + | |||
| + | == The CORE Storage Primitive: Cross-Object Redundancy for Efficient Data Repair & Access in Erasure Coded Storage == | ||
| + | |||
| + | Kyumars Sheykh Esmaili, Lluis Pamies-Juarez, Anwitaman Datta\\ | ||
| + | [[http://arxiv.org/abs/1302.5192|arXiv]] | ||
| + | |||
| + | ----- | ||
| + | |||
| + | == A Cost-based Heterogeneous Recovery Scheme for Distributed Storage Systems with RAID-6 Codes == | ||
| + | |||
| + | Yunfeng Zhu, Patrick P. C. Lee, Liping Xiang, Yinlong Xu and Lingling Gao\\ | ||
| + | Proceedings of the 42nd IEEE/IFIP International Conference on Dependable Systems and Networks - Performance and Dependability Symposium (DSN-PDS), June 2012.\\ | ||
| + | [[http://dx.doi.org/10.1109/DSN.2012.6263934|IEEE Xplore]] | ||
| + | [[http://ansrlab.cse.cuhk.edu.hk/software/chr|software]]\\ | ||
| + | |||
| + | ----- | ||
| + | |||
| + | == On the Speedup of Single-Disk Failure Recovery in XOR-Coded Storage Systems: Theory and Practice == | ||
| + | |||
| + | Yunfeng Zhu, Patrick P. C. Lee, Yuchong Hu, Liping Xiang, Yinlong Xu\\ | ||
| + | Proceedings of the 28th IEEE Conference on Massive Storage Systems and Technologies (MSST 2012), April 2012.\\ | ||
| + | [[http://dx.doi.org/10.1109/MSST.2012.6232371|IEEE Xplore]] | ||
| + | [[http://ansrlab.cse.cuhk.edu.hk/software/zpacr|software]]\\ | ||
| + | |||
| + | ----- | ||
| == Enabling Node Repair in Any Erasure Code for Distributed Storage == | == Enabling Node Repair in Any Erasure Code for Distributed Storage == | ||
| Line 622: | Line 820: | ||
| ===== Security in Distributed Storage ===== | ===== Security in Distributed Storage ===== | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Secure Regenerating Codes Based on Rashmi-Shah-Kumar MBR Codes == | ||
| + | |||
| + | M Kurihara, H Kuwakado\\ | ||
| + | [[http://search.ieice.org/bin/summary.php?id=e96-a_2_635|online]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Update-Efficient Error-Correcting Regenerating Codes == | ||
| + | |||
| + | Yunghsiang S. Han, Hong-Ta Pai, Rong Zheng, and Pramod K. Varshney\\ | ||
| + | [[http://arxiv.org/abs/1301.4620|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Update-Efficient Regenerating Codes with Minimum Per-Node Storage == | ||
| + | |||
| + | Yunghsiang S. Han, Hong-Ta Pai, Rong Zheng, and Pramod K. Varshney\\ | ||
| + | [[http://arxiv.org/abs/1301.2497|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Optimal Locally Repairable and Secure Codes for Distributed Storage Systems == | ||
| + | |||
| + | Ankit Singh Rawat, O. Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath\\ | ||
| + | [[http://arxiv.org/abs/1210.6954|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Secure Cooperative Regenerating Codes for Distributed Storage Systems == | ||
| + | |||
| + | O. Ozan Koyluoglu, Ankit Singh Rawat, Sriram Vishwanath\\ | ||
| + | [[http://arxiv.org/abs/1210.3664|arXiv]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Enabling Data Integrity Protection in Regenerating-Coding-Based Cloud Storage == | ||
| + | Henry C. H. Chen and Patrick P. C. Lee\\ | ||
| + | Proceedings of the 31st IEEE International Symposium on Reliable Distributed Systems (SRDS 2012), October 2012.\\ | ||
| + | [[http://www.cse.cuhk.edu.hk/~pclee/www/pubs/srds12.pdf|pdf]] | ||
| + | [[http://ansrlab.cse.cuhk.edu.hk/~pclee/software/fmsrdip|software]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage == | ||
| + | Y. S. Han, R. Zheng and W. H. Mow \\ | ||
| + | INFOCOM 2012\\ | ||
| + | [[http://arxiv.org/abs/1108.3883| arXiv]]\\ | ||
| + | [[papers:Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage |More]] \\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Progressive Data Retrieval for Distributed Networked Storage == | ||
| + | Y. S. Han, S. Omiwade, and R. Zheng\\ | ||
| + | to appear in IEEE Trans. on Parallel and Distributed Systems, 2012.\\ | ||
| + | [[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6152094&contentType=Early+Access+Articles&queryText%3DProgressive+Data+Retrieval+for+Distributed+Networked+Storage|IEEE Xplore]]\\ | ||
| + | |||
| + | ---- | ||
| == Secret Share Dissemination across a Network == | == Secret Share Dissemination across a Network == | ||
| Line 745: | Line 1003: | ||
| General Description of [[wiki:definitions:inserting data distributed storage|Redundancy Generation Problem in Distributed Storage]] | General Description of [[wiki:definitions:inserting data distributed storage|Redundancy Generation Problem in Distributed Storage]] | ||
| + | |||
| + | == Decentralized Erasure Coding for Efficient Data Archival in Distributed Storage Systems == | ||
| + | Lluis Pamies-Juarez, Frédérique Oggier, Anwitaman Datta\\ | ||
| + | //Proceedings of the 14th International Conference on Distributed Computing and Networking (ICDCN) 2013//\\ | ||
| == RapidRAID: Pipelined Erasure Codes for Fast Data Archival in Distributed Storage Systems == | == RapidRAID: Pipelined Erasure Codes for Fast Data Archival in Distributed Storage Systems == | ||
| Line 757: | Line 1019: | ||
| ---- | ---- | ||
| + | |||
| + | |||
| + | ===== Local Repair in Distributed Storage ===== | ||
| + | |||
| + | * Papers in Reverse Chronological Order | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Explicit MBR All-Symbol Locality Codes == | ||
| + | |||
| + | GM Kamath, N Prakash, V Lalitha, PV Kumar, N Silberstein, AS Rawat, OO Koyluoglu, S Vishwanath\\ | ||
| + | [[http://arxiv.org/pdf/1302.0744.pdf|online]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Optimal Locally Repairable Codes via Rank-Metric Codes == | ||
| + | |||
| + | N Silberstein, AS Rawat, OO Koyluoglu, S Vishwanath \\ | ||
| + | [[http://arxiv.org/pdf/1301.6331.pdf|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Storage codes--coding rate and repair locality == | ||
| + | |||
| + | HDL Hollmann \\ | ||
| + | [[http://arxiv.org/pdf/1301.4300.pdf|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == On the Locality of Codeword Symbols == | ||
| + | |||
| + | P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin \\ | ||
| + | IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 6925–6934, Nov. 2012. \\ | ||
| + | [[http://arxiv.org/abs/1106.3625|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Codes with Local Regeneration == | ||
| + | |||
| + | G. M. Kamath, N. Prakash, V. Lalitha, P. V. Kumar \\ | ||
| + | arXiv, Nov. 2012. \\ | ||
| + | [[http://arxiv.org/abs/1211.1932|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Optimal locally repairable and secure codes for distributed storage systems == | ||
| + | |||
| + | A. S. Rawat, O. O. Koyluoglu, N. Silberstein, S. Vishwanath \\ | ||
| + | arXiv, Oct. 2012. \\ | ||
| + | [[http://arxiv.org/abs/1210.6954|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Error Resilience in Distributed Storage via Rank-Metric Codes == | ||
| + | |||
| + | N. Silberstein, A. S. Rawat, S. Vishwanath \\ | ||
| + | Proc. Fiftieth Annual Allerton Conference on Communication, Control, and Computing, Oct. 2012. \\ | ||
| + | [[http://arxiv.org/abs/1202.0800|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Locally repairable codes == | ||
| + | |||
| + | D. S. Papailiopoulos, A. G. Dimakis \\ | ||
| + | Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, Jul. 2012. \\ | ||
| + | [[http://arxiv.org/abs/1206.3804|arXiv]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Erasure coding in windows azure storage == | ||
| + | |||
| + | C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, S. Yekhanin \\ | ||
| + | Proc. 2012 USENIX Annual Technical Conference, Boston, MA, Jun. 2012. \\ | ||
| + | [[https://www.usenix.org/system/files/conference/atc12/atc12-final181_0.pdf]] | ||
| + | |||
| + | ---------------- | ||
| + | == Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems == | ||
| + | Frederique Oggier and Anwitaman Datta,\\ | ||
| + | On axXiv: July 2011. {{http://arxiv.org/abs/1107.3129|Preprint}}\\ | ||
| + | Note: This is a substantially extended version of an {{http://arxiv.org/abs/1008.0064|earlier work}} published in Infocom 2011\\ | ||
| + | [[http://sands.sce.ntu.edu.sg/CodingForNetworkedStorage/ | Project homepage]]\\ | ||
| + | |||
| + | ---------------- | ||
| + | == Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction == | ||
| + | Frederique Oggier and Anwitaman Datta,\\ | ||
| + | In IEEE Information Theory Workshop (ITW) 2011.\\ | ||
| + | {{http://arxiv.org/abs/1105.0379|Preprint}}\\ | ||
| + | [[papers: Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction|More]] \\ | ||
| + | [[http://sands.sce.ntu.edu.sg/CodingForNetworkedStorage/ | Project homepage]]\\ | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Self-repairing Homomorphic Codes for Distributed Storage Systems == | ||
| + | F. Oggier, A. Datta \\ | ||
| + | in Proc. 2011 IEEE International Conference on Computer Communications (INFOCOM)\\ | ||
| + | Arxiv, July 2010.\\ | ||
| + | Note: A {{http://arxiv.org/abs/1107.3129|substantially extended}} version of this work is now available\\ | ||
| + | [[http://arxiv.org/abs/1008.0064|Arxiv]] \\ | ||
| + | [[papers:Self-repairing codes|More]] | ||
