메뉴 건너뛰기




Volumn 2015, Issue 1, 2015, Pages 1-17

Cooperative local repair in distributed storage

Author keywords

Codes on graphs; Coding for distributed storage; Cooperative repair; Locally repairable codes

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; MULTIPROCESSING SYSTEMS; REPAIR;

EID: 84951270571     PISSN: 16876172     EISSN: 16876180     Source Type: Journal    
DOI: 10.1186/s13634-015-0292-0     Document Type: Article
Times cited : (51)

References (33)
  • 2
    • 79961002025 scopus 로고    scopus 로고
    • Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction
    • K Rashmi, N Shah, P Kumar, Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inf. Theory. 57:, 5227–5239 (2011). doi:10.1109/TIT.2011.2159049.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , pp. 5227-5239
    • Rashmi, K.1    Shah, N.2    Kumar, P.3
  • 3
    • 84873909669 scopus 로고    scopus 로고
    • Zigzag codes: MDS array codes with optimal rebuilding
    • I Tamo, Z Wang, J Bruck, Zigzag codes: MDS array codes with optimal rebuilding. IEEE Trans. Inf. Theory. 59(3), 1597–1616 (2013). doi:10.1109/TIT.2012.2227110.
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.3 , pp. 1597-1616
    • Tamo, I.1    Wang, Z.2    Bruck, J.3
  • 4
    • 84890376365 scopus 로고    scopus 로고
    • Repair optimal erasure codes through Hadamard designs
    • DS Papailiopoulos, AG Dimakis, V Cadambe, Repair optimal erasure codes through Hadamard designs. IEEE Trans. Inf. Theory. 59(5), 3021–3037 (2013). doi:10.1109/TIT.2013.2241819.
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.5 , pp. 3021-3037
    • Papailiopoulos, D.S.1    Dimakis, A.G.2    Cadambe, V.3
  • 8
    • 79960854501 scopus 로고    scopus 로고
    • Self-repairing homomorphic codes for distributed storage systems
    • IEEE Press, Piscataway, NJ, USA
    • F Oggier, A Datta, in Proceedings 2011 IEEE INFOCOM. Self-repairing homomorphic codes for distributed storage systems (IEEE PressPiscataway, NJ, USA, 2011), pp. 1215–1223. doi:10.1109/INFCOM.2011.5934901.
    • (2011) Proceedings 2011 IEEE INFOCOM , pp. 1215-1223
    • Oggier, F.1    Datta, A.2
  • 10
    • 84904630840 scopus 로고    scopus 로고
    • Codes with local regeneration and erasure correction
    • GM Kamath, N Prakash, V Lalitha, PV Kumar, Codes with local regeneration and erasure correction. IEEE Trans. Inf. Theory. 60(8), 4637–4660 (2014). doi:10.1109/TIT.2014.2329872.
    • (2014) IEEE Trans. Inf. Theory , vol.60 , Issue.8 , pp. 4637-4660
    • Kamath, G.M.1    Prakash, N.2    Lalitha, V.3    Kumar, P.V.4
  • 11
    • 84904709057 scopus 로고    scopus 로고
    • A family of optimal locally recoverable codes
    • I Tamo, A Barg, A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory. 60(8), 4661–4676 (2014). doi:10.1109/TIT.2014.2321280.
    • (2014) IEEE Trans. Inf. Theory , vol.60 , Issue.8 , pp. 4661-4676
    • Tamo, I.1    Barg, A.2
  • 14
    • 84886678179 scopus 로고    scopus 로고
    • Cooperative regenerating codes
    • KW Shum, Y Hu, Cooperative regenerating codes. IEEE Trans. Inf. Theory. 59(11), 7229–7258 (2013).
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.11 , pp. 7229-7258
    • Shum, K.W.1    Hu, Y.2
  • 18
    • 84906535760 scopus 로고    scopus 로고
    • Bounds on locally recoverable codes with multiple recovering sets
    • IEEE Press, Piscataway, NJ, USA
    • I Tamo, A Barg, in Proc. 2014 IEEE International Symposium on Information Theory (ISIT). Bounds on locally recoverable codes with multiple recovering sets (IEEE PressPiscataway, NJ, USA, 2014), pp. 691–695. doi:10.1109/ISIT.2014.6874921.
    • (2014) Proc. 2014 IEEE International Symposium on Information Theory (ISIT) , pp. 691-695
    • Tamo, I.1    Barg, A.2
  • 19
    • 84908240140 scopus 로고    scopus 로고
    • Repair locality with multiple erasure tolerance
    • A Wang, Z Zhang, Repair locality with multiple erasure tolerance. IEEE Trans. Inf. Theory. 60(11), 6979–6987 (2014). doi:10.1109/TIT.2014.2351404.
    • (2014) IEEE Trans. Inf. Theory , vol.60 , Issue.11 , pp. 6979-6987
    • Wang, A.1    Zhang, Z.2
  • 21
    • 84861602545 scopus 로고    scopus 로고
    • Simple regenerating codes: network coding for cloud storage
    • IEEE Press, Piscataway, NJ, USA
    • DS Papailiopoulos, J Luo, AG Dimakis, C Huang, J Li, in Proceedings 2012 IEEE INFOCOM. Simple regenerating codes: network coding for cloud storage (IEEE PressPiscataway, NJ, USA, 2012), pp. 2801–2805. doi:10.1109/INFCOM.2012.6195703.
    • (2012) Proceedings 2012 IEEE INFOCOM , pp. 2801-2805
    • Papailiopoulos, D.S.1    Luo, J.2    Dimakis, A.G.3    Huang, C.4    Li, J.5
  • 22
    • 84883341152 scopus 로고    scopus 로고
    • An upper bound on the size of locally recoverable codes
    • IEEE Press, Piscataway, NJ, USA
    • V Cadambe, A Mazumdar, in 2013 International Symposium on Network Coding (NetCod). An upper bound on the size of locally recoverable codes (IEEE PressPiscataway, NJ, USA, 2013), pp. 1–5. doi:10.1109/NetCod.2013.6570829.
    • (2013) 2013 International Symposium on Network Coding (NetCod) , pp. 1-5
    • Cadambe, V.1    Mazumdar, A.2
  • 23
    • 84897677500 scopus 로고    scopus 로고
    • On the locality of codeword symbols in non-linear codes
    • M Forbes, S Yekhanin, On the locality of codeword symbols in non-linear codes. Discrete Math. 324:, 7 (2014). 10.1016/j.disc.2014.01.016, http://dx.doi.org/10.1016/j.disc.2014.01.016.
    • (2014) Discrete Math , vol.324 , pp. 7
    • Forbes, M.1    Yekhanin, S.2
  • 25
    • 0011514730 scopus 로고
    • Explicit construction of graphs with an arbitrary large girth and of large size
    • F Lazebnik, VA Ustimenko, Explicit construction of graphs with an arbitrary large girth and of large size. Discret. Appl. Math.60(1–3), 275–284 (1995).
    • (1995) Discret. Appl. Math. , vol.60 , Issue.1-3 , pp. 275-284
    • Lazebnik, F.1    Ustimenko, V.A.2
  • 26
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • R Tanner, A recursive approach to low complexity codes. IEEE Trans. Inf. Theor.27(5), 533–547 (1981). doi:10.1109/TIT.1981.1056404.
    • (1981) IEEE Trans. Inf. Theor. , vol.27 , Issue.5 , pp. 533-547
    • Tanner, R.1
  • 30
    • 0035246490 scopus 로고    scopus 로고
    • On expander codes
    • G Zemor, On expander codes. IEEE Trans. Inf. Theory. 47(2), 835–837 (2001). doi:10.1109/18.910593.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 835-837
    • Zemor, G.1
  • 31
    • 77957074439 scopus 로고
    • Explicit construction of linear sized tolerant networks
    • N Alon, FRK Chung, Explicit construction of linear sized tolerant networks. Discrete Math.72(1-3), 15–19 (1988). doi:10.1016/0012-365X(88)90189-6.
    • (1988) Discrete Math. , vol.72 , Issue.1-3 , pp. 15-19
    • Alon, N.1    Chung, F.R.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.