Error-Correcting Codes for Networks, Storage and Computation

[1]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[2]  Kannan Ramchandran,et al.  Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions , 2010, IEEE Transactions on Information Theory.

[3]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

[4]  Alexander Sprintson,et al.  Weakly Secure Network Coding for Wireless Cooperative Data Exchange , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[5]  Pierre Loidreau,et al.  A Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes , 2005, WCC.

[6]  Vinod M. Prabhakaran,et al.  Decentralized erasure codes for distributed networked storage , 2006, IEEE Transactions on Information Theory.

[7]  A. Robert Calderbank,et al.  Cyclic LRC codes and their subfield subcodes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[8]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[9]  Luiz André Barroso,et al.  The tail at scale , 2013, CACM.

[10]  Tracey Ho,et al.  Distributed gabidulin codes for multiple-source network error correction , 2014, 2014 International Symposium on Network Coding (NetCod).

[11]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[13]  Itzhak Tamo,et al.  A family of optimal locally recoverable codes , 2014, ISIT.

[14]  Dimitris S. Papailiopoulos,et al.  Optimal locally repairable codes and connections to matroid theory , 2013, 2013 IEEE International Symposium on Information Theory.

[15]  Ulas C. Kozat,et al.  TOFEC: Achieving optimal throughput-delay trade-off of cloud storage using erasure codes , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[16]  Chau Yuen,et al.  On the existence of MDS codes over small fields with constrained generator matrices , 2014, 2014 IEEE International Symposium on Information Theory.

[17]  Frank R. Kschischang,et al.  Fast encoding and decoding of Gabidulin codes , 2009, 2009 IEEE International Symposium on Information Theory.

[18]  Nihar B. Shah,et al.  Enabling node repair in any erasure code for distributed storage , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[19]  Kees Roos.  A Generalization of the BCH Bound for Cyclic Codes, Including the Hartmann-Tzeng Bound , 1982, J. Comb. Theory, Ser. A.

[20]  Chau Yuen,et al.  Locally Encodable and Decodable Codes for Distributed Storage Systems , 2014, GLOBECOM 2014.

[21]  Robert McEliece,et al.  The Theory of Information and Coding: Information theory , 2002 .

[22]  Vladimir Sidorenko,et al.  Fast decoding of Gabidulin codes , 2011, Des. Codes Cryptogr..

[23]  Suhas N. Diggavi,et al.  On the capacity of multisource non-coherent network coding , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[24]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[25]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[26]  Mor Harchol-Balter.  The Effect of Heavy-Tailed Job Size Distributions on Computer System Design , 1999 .

[27]  Amir Salman Avestimehr,et al.  Coded Computation Over Heterogeneous Clusters , 2019, IEEE Transactions on Information Theory.

[28]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[29]  Mohammad Ali Maddah-Ali,et al.  Fundamental tradeoff between computation and communication in distributed computing , 2016, ISIT.

[30]  Mohammad Ali Maddah-Ali,et al.  A Unified Coding Framework for Distributed Computing with Straggling Servers , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[31]  Gregory W. Wornell,et al.  Efficient task replication for fast response times in parallel computation , 2014, SIGMETRICS '14.

[32]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[33]  Dimitris S. Papailiopoulos,et al.  Speeding up distributed machine learning using codes , 2016, ISIT.

[34]  Kannan Ramchandran,et al.  Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.

[35]  Chau Yuen,et al.  Balanced Sparsest generator matrices for MDS codes , 2013, 2013 IEEE International Symposium on Information Theory.

[36]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[37]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.

[38]  Cory Hill,et al.  f4: Facebook's Warm BLOB Storage System , 2014, OSDI.

[39]  Babak Hassibi,et al.  Balanced and sparse Tamo-Barg codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[40]  Å. Björck,et al.  Solution of Vandermonde Systems of Equations , 1970 .

[41]  Suhas N. Diggavi,et al.  Noncoherent multisource network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[42]  Gregory W. Wornell,et al.  Using Straggler Replication to Reduce Latency in Large-scale Parallel Computing , 2015, PERV.

[43]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[44]  Frédérique Oggier,et al.  Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.

[45]  Kees Roos,et al.  A new lower bound for the minimum distance of a cyclic code , 1983, IEEE Trans. Inf. Theory.

[46]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[47]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[48]  Ning Cai,et al.  Network Error Correction, I: Basic Concepts and Upper Bounds , 2006, Commun. Inf. Syst..

[49]  Chau Yuen,et al.  On Simple Multiple Access Networks , 2015, IEEE Journal on Selected Areas in Communications.

[50]  Alexander Vardy,et al.  MDS array codes with independent parity symbols , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[51]  Chau Yuen,et al.  Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[52]  Pulkit Grover,et al.  “Short-Dot”: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products , 2017, IEEE Transactions on Information Theory.

[53]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[54]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[55]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[56]  Kerstin Vännman,et al.  Estimators Based on Order Statistics from a Pareto Distribution , 1976 .

[57]  Philippe Delsarte,et al.  Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.

[58]  Tracey Ho,et al.  Distributed reed-solomon codes for simple multiple access networks , 2014, 2014 IEEE International Symposium on Information Theory.

[59]  Sidharth Jaggi,et al.  Multiple-Access Network Information-Flow and Correction Codes , 2010, IEEE Transactions on Information Theory.

[60]  Babak Hassibi,et al.  Coding with constraints: Minimum distance bounds and systematic constructions , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[61]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[62]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2014, IEEE Trans. Inf. Theory.

[63]  Stephen J. Wright,et al.  Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent , 2011, NIPS.

[64]  Sriram Vishwanath,et al.  Optimal locally repairable codes via rank-metric codes , 2013, 2013 IEEE International Symposium on Information Theory.

[65]  Sriram Vishwanath,et al.  Optimal Locally Repairable and Secure Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[66]  Alexander J. Smola,et al.  Parallelized Stochastic Gradient Descent , 2010, NIPS.

[67]  Kannan Ramchandran,et al.  Explicit construction of optimal exact regenerating codes for distributed storage , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[68]  Peter J. Haas,et al.  Large-scale matrix factorization with distributed stochastic gradient descent , 2011, KDD.

[69]  Dimitris S. Papailiopoulos,et al.  XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..

[70]  P. Vijay Kumar,et al.  Codes With Local Regeneration and Erasure Correction , 2014, IEEE Transactions on Information Theory.

[71]  Carlos R. P. Hartmann,et al.  Generalizations of the BCH Bound , 1972, Inf. Control..

[72]  Tracey Ho,et al.  Key agreement for wireless networks in the presence of active adversaries , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).