-
1
-
-
77955726417
-
Network coding for distributed storage systems
-
AG Dimakis, P Godfrey, Y Wu, M Wainwright, K Ramchandran, Network coding for distributed storage systems. IEEE Trans. Inf. Theory. 56(9), 4539–4551 (2010). doi:10.1109/TIT.2010.2054295.
-
(2010)
IEEE Trans. Inf. Theory
, vol.56
, Issue.9
, pp. 4539-4551
-
-
Dimakis, A.G.1
Godfrey, P.2
Wu, Y.3
Wainwright, M.4
Ramchandran, K.5
-
2
-
-
79961002025
-
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
-
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
-
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
-
5
-
-
85038073809
-
In search of I/O-optimal recovery from disk failures
-
USENIX Association, Berkeley, CA, USA
-
O Khan, R Burns, J Park, C Huang, in Proceedings of the 3rd USENIX Conference on Hot Topics in Storage and File Systems. HotStorage’11. In search of I/O-optimal recovery from disk failures (USENIX AssociationBerkeley, CA, USA, 2011). http://dl.acm.org/citation.cfm?id=2002218.2002224.
-
(2011)
Proceedings of the 3rd USENIX Conference on Hot Topics in Storage and File Systems. HotStorage’11
-
-
Khan, O.1
Burns, R.2
Park, J.3
Huang, C.4
-
6
-
-
84867975111
-
On the locality of codeword symbols
-
P Gopalan, C Huang, H Simitci, S Yekhanin, On the locality of codeword symbols. IEEE Trans. Inf. Theory. 58(11), 6925–6934 (2012). doi:10.1109/TIT.2012.2208937.
-
(2012)
IEEE Trans. Inf. Theory
, vol.58
, Issue.11
, pp. 6925-6934
-
-
Gopalan, P.1
Huang, C.2
Simitci, H.3
Yekhanin, S.4
-
8
-
-
79960854501
-
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
-
9
-
-
84893010187
-
Optimal locally repairable and secure codes for distributed storage systems
-
AS Rawat, OO Koyluoglu, N Silberstein, S Vishwanath, Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inf. Theory. 60(1), 212–236 (2014).
-
(2014)
IEEE Trans. Inf. Theory
, vol.60
, Issue.1
, pp. 212-236
-
-
Rawat, A.S.1
Koyluoglu, O.O.2
Silberstein, N.3
Vishwanath, S.4
-
10
-
-
84904630840
-
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
-
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
-
12
-
-
85076902294
-
Availability in globally distributed storage systems
-
USENIX, Berkeley, CA
-
D Ford, F Labelle, F Popovici, M Stokely, V-A Truong, L Barroso, C Grimes, S Quinlan, in Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI). Availability in globally distributed storage systems (USENIXBerkeley, CA, 2010).
-
(2010)
Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI)
-
-
Ford, D.1
Labelle, F.2
Popovici, F.3
Stokely, M.4
Truong, V.-A.5
Barroso, L.6
Grimes, C.7
Quinlan, S.8
-
13
-
-
80052984151
-
Repairing multiple failures with coordinated and adaptive regenerating codes
-
IEEE Press, Piscataway, NJ, USA
-
AM Kermarrec, NL Scouarnec, G Straub, in Proc. International Symposium on Network Coding. Repairing multiple failures with coordinated and adaptive regenerating codes (IEEE PressPiscataway, NJ, USA, 2011).
-
(2011)
Proc. International Symposium on Network Coding
-
-
Kermarrec, A.M.1
Scouarnec, N.L.2
Straub, G.3
-
14
-
-
84886678179
-
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
-
15
-
-
0002588311
-
A new series of dense graphs of high girth
-
F Lazebnik, VA Ustimenko, AJ Woldar, A new series of dense graphs of high girth. Bull. Am. Math. Soc.32(1), 73–79 (1995).
-
(1995)
Bull. Am. Math. Soc.
, vol.32
, Issue.1
, pp. 73-79
-
-
Lazebnik, F.1
Ustimenko, V.A.2
Woldar, A.J.3
-
16
-
-
84867522880
-
Optimal linear codes with a local-error-correction property
-
IEEE Press, Piscataway, NJ, USA
-
N Prakash, GM Kamath, V Lalitha, PV Kumar, in Proc. 2012 IEEE International Symposium on Information Theory (ISIT). Optimal linear codes with a local-error-correction property (IEEE PressPiscataway, NJ, USA, 2012), pp. 2776–2780. doi:10.1109/ISIT.2012.6284028.
-
(2012)
Proc. 2012 IEEE International Symposium on Information Theory (ISIT)
, pp. 2776-2780
-
-
Prakash, N.1
Kamath, G.M.2
Lalitha, V.3
Kumar, P.V.4
-
17
-
-
84890320329
-
Locally repairable codes with multiple repair alternatives
-
IEEE Press, Piscataway, NJ, USA
-
L Pamies-Juarez, HDL Hollmann, F Oggier, in Proc. 2013 IEEE International Symposium on Information Theory (ISIT). Locally repairable codes with multiple repair alternatives (IEEE PressPiscataway, NJ, USA, 2013), pp. 892–896. doi:10.1109/ISIT.2013.6620355.
-
(2013)
Proc. 2013 IEEE International Symposium on Information Theory (ISIT)
, pp. 892-896
-
-
Pamies-Juarez, L.1
Hollmann, H.D.L.2
Oggier, F.3
-
18
-
-
84906535760
-
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
-
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
-
20
-
-
84906544968
-
Locality and availability in distributed storage
-
IEEE Press, Piscataway, NJ, USA
-
AS Rawat, DS Papailiopoulos, AG Dimakis, S Vishwanath, in Proceedings of the IEEE International Symposium on Information Theory (ISIT). Locality and availability in distributed storage (IEEE PressPiscataway, NJ, USA, 2014), pp. 681–685.
-
(2014)
Proceedings of the IEEE International Symposium on Information Theory (ISIT)
, pp. 681-685
-
-
Rawat, A.S.1
Papailiopoulos, D.S.2
Dimakis, A.G.3
Vishwanath, S.4
-
21
-
-
84861602545
-
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
-
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
-
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
-
24
-
-
84906565397
-
Codes with locality for two erasures
-
IEEE Press, Piscataway, NJ, USA
-
N Prakash, V Lalitha, PV Kumar, in Proc. 2014 IEEE International Symposium on Information Theory (ISIT). Codes with locality for two erasures (IEEE PressPiscataway, NJ, USA, 2014), pp. 1962–1966. doi:10.1109/ISIT.2014.6875176.
-
(2014)
Proc. 2014 IEEE International Symposium on Information Theory (ISIT)
, pp. 1962-1966
-
-
Prakash, N.1
Lalitha, V.2
Kumar, P.V.3
-
25
-
-
0011514730
-
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
-
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
-
27
-
-
0036354005
-
Stopping sets and the girth of tanner graphs
-
IEEE Press, Piscataway, NJ, USA
-
A Orlitsky, R Urbanke, K Viswanathan, J Zhang, in Proc. 2002 IEEE International Symposium on Information Theory (ISIT). Stopping sets and the girth of tanner graphs (IEEE PressPiscataway, NJ, USA, 2002), pp. 2–2.
-
(2002)
Proc. 2002 IEEE International Symposium on Information Theory (ISIT)
, pp. 2
-
-
Orlitsky, A.1
Urbanke, R.2
Viswanathan, K.3
Zhang, J.4
-
29
-
-
0036041924
-
Randomness conductors and constant-degree lossless expanders
-
ACM, New York, NY, USA
-
M Capalbo, O Reingold, S Vadhan, A Wigderson, in Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing. STOC ’02. Randomness conductors and constant-degree lossless expanders (ACMNew York, NY, USA, 2002), pp. 659–668. doi:10.1145/509907.510003. http://doi.acm.org/10.1145/509907.510003.
-
(2002)
Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing. STOC ’02
, pp. 659-668
-
-
Capalbo, M.1
Reingold, O.2
Vadhan, S.3
Wigderson, A.4
-
30
-
-
0035246490
-
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
-
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
-
33
-
-
84877646093
-
Local recovery properties of capacity achieving codes
-
IEEE Press, Piscataway, NJ, USA
-
A Mazumdar, V Chandar, GW Wornell, in Proc. 2013 Information Theory and Applications Workshop (ITA). Local recovery properties of capacity achieving codes (IEEE PressPiscataway, NJ, USA, 2013), pp. 1–3. doi:10.1109/ITA.2013.6502958.
-
(2013)
Proc. 2013 Information Theory and Applications Workshop (ITA)
, pp. 1-3
-
-
Mazumdar, A.1
Chandar, V.2
Wornell, G.W.3
|