Extended Product and Integrated Interleaved Codes

A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is given, as well as constructions meeting the bound for some relevant cases. A special case of EPC codes, Extended Integrated Interleaved (EII) codes, which naturally unify Integrated Interleaved (II) codes and product codes, is defined and studied in detail. It is shown that EII codes often improve the minimum distance of II codes with the same rate, and they enhance the decoding algorithm by allowing decoding on columns as well as on rows. It is also shown that EII codes allow for encoding II codes with an uniform distribution of the parity symbols.

[1]  Mario Blaum,et al.  New array codes for multiple phased burst correction , 1993, IEEE Trans. Inf. Theory.

[2]  M. Klamkin,et al.  Extensions of the birthday surprise , 1967 .

[3]  Mario Blaum,et al.  Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems , 2014, TOS.

[4]  Cheng Huang,et al.  Explicit Maximally Recoverable Codes With Locality , 2013, IEEE Transactions on Information Theory.

[5]  J. H. Lodge,et al.  Graph theoretic construction of generalized product codes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[6]  Mario Blaum,et al.  Generalized and Extended Product Codes , 2016, ArXiv.

[7]  Dimitris S. Papailiopoulos,et al.  Locality and Availability in Distributed Storage , 2014, IEEE Transactions on Information Theory.

[8]  Eitan Yaakobi,et al.  Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors , 2014, 2014 IEEE International Symposium on Information Theory.

[9]  Xinmiao Zhang.  Modified Generalized Integrated Interleaved Codes for Local Erasure Recovery , 2017, IEEE Communications Letters.

[10]  Martin Bossert,et al.  Multi-block interleaved codes for local and global read access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  Diego Napp Avelli,et al.  Erasure codes with simplex locality , 2014, ArXiv.

[12]  Chau Yuen,et al.  Optimal Locally Repairable Linear Codes , 2014, IEEE Journal on Selected Areas in Communications.

[13]  Shubhangi Saraf,et al.  Maximally Recoverable Codes for Grid-like Topologies , 2016, SODA.

[14]  P. Vijay Kumar,et al.  Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[15]  Guangda Hu,et al.  New constructions of SD and MR codes over small finite fields , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[16]  Zhifang Zhang,et al.  Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.

[17]  Mario Blaum,et al.  SD codes: erasure codes designed for how storage systems really fail , 2013, FAST.

[18]  Robert J. McEliece,et al.  On the decoder error probability for Reed-Solomon codes , 1986, IEEE Trans. Inf. Theory.

[19]  Yingquan Wu.  Generalized Integrated Interleaved Codes , 2017, IEEE Transactions on Information Theory.

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

[21]  Kar-Ming Cheung.  Error-Correction Coding in Data Storage Systems , 1987 .

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

[23]  Eitan Yaakobi,et al.  Bounds and constructions of codes with multiple localities , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[24]  Xiao Li,et al.  Sector-disk codes with three global parities , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[25]  Kar-Ming Cheung.  More on the decoder error probability for Reed-Solomon codes , 1989, IEEE Trans. Inf. Theory.

[26]  Henry D. Pfister,et al.  Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates , 2015, IEEE Transactions on Information Theory.

[27]  Johan P. Hansen,et al.  Algebraic Geometry Codes , 2005 .

[28]  Ian F. Blake,et al.  Algebraic-Geometry Codes , 1998, IEEE Trans. Inf. Theory.

[29]  Robert J. McEliece,et al.  Lifetime analyses of error-control coded semiconductor RAM systems , 1982 .

[30]  Mingqiang Li,et al.  STAIR Codes: A General Family of Erasure Codes for Tolerating Device and Sector Failures , 2014, TOS.

[31]  Mario Blaum,et al.  Partial-MDS Codes and Their Application to RAID Type of Architectures , 2012, IEEE Transactions on Information Theory.

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

[33]  Mario Blaum,et al.  Integrated interleaved codes as locally recoverable codes: properties and performance , 2016, Int. J. Inf. Coding Theory.

[34]  Khaled Abdel-Ghaffar,et al.  Integrated interleaving - a novel ECC architecture , 2001 .

[35]  Joseph Jean Boutros,et al.  Stopping sets for MDS-based product codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[36]  Ralf Koetter,et al.  A Novel Method for Combining Algebraic Decoding and Iterative Processing , 2006, 2006 IEEE International Symposium on Information Theory.

[37]  Cheng Huang,et al.  Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.

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

[39]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.

[40]  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).

[41]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[42]  Eitan Yaakobi,et al.  Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols , 2016, IEEE Transactions on Information Theory.