Families of Optimal Binary Non-MDS Erasure Codes

We introduce a definition for Families of Optimal Binary Non-MDS Erasure Codes for [n, k] codes over GF(2), and propose an algorithm for finding those families by using hill climbing techniques over Balanced XOR codes. Due to the hill climbing search, those families of codes have always better decoding probability than the codes generated in a typical Random Linear Network Coding scenario, i.e., random linear codes. We also show a surprising result that for small values of k, the decoding probability of our codes in GF(2) is very close to the decoding probability of the codes obtained by Random Linear Network Coding but in the higher finite field GF(4).

[1]  Peter F. Corbett,et al.  Row-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!) , 2004, USENIX Conference on File and Storage Technologies.

[2]  Pascal Frossard,et al.  Scalable video dissemination with prioritized network coding , 2011, 2011 IEEE International Conference on Multimedia and Expo.

[3]  Ethan L. Miller,et al.  Screaming fast Galois field arithmetic using intel SIMD instructions , 2013, FAST.

[4]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[5]  Seung-won Hwang,et al.  Ursa: Scalable Load and Power Management in Cloud Storage Systems , 2013, TOS.

[6]  Cheng Huang,et al.  Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads , 2012, FAST.

[7]  Cheng Huang,et al.  STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures , 2005, IEEE Transactions on Computers.

[8]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[9]  Marco Fiore,et al.  Exact Decoding Probability Under Random Linear Network Coding , 2010, IEEE Communications Letters.

[10]  J. Heide,et al.  Network Coding for Mobile Devices - Systematic Binary Random Rateless Codes , 2009, 2009 IEEE International Conference on Communications Workshops.

[11]  Mario A. de Boer,et al.  Almost MDS codes , 1996, Des. Codes Cryptogr..

[12]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[13]  James Lee Hafner,et al.  WEAVER codes: highly fault tolerant erasure codes for storage systems , 2005, FAST'05.

[14]  Soroush Akhlaghi,et al.  A Non-MDS Erasure Code Scheme For Storage Applications , 2011, ArXiv.

[15]  Morten Videbæk Pedersen,et al.  Multimedia distribution using network coding on the iphone platform , 2010, MCMC '10.

[16]  Milica Stojanovic,et al.  Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

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

[18]  Xiaozhou Li,et al.  Flat XOR-based erasure codes in storage systems: Constructions, efficient recovery, and tradeoffs , 2010, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST).

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

[20]  Muriel Médard,et al.  On Code Parameters and Coding Vector Representation for Practical RLNC , 2011, 2011 IEEE International Conference on Communications (ICC).

[21]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[22]  Harald Øverby,et al.  Balanced XOR-ed Coding , 2013, EUNICE.

[23]  Stefan Dodunekov,et al.  On near-MDS codes , 1994 .

[24]  W. Marsden.  I and J , 2012 .

[25]  Gou Hosoya,et al.  国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .

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